Certificate for #1979 ⟨a, b, c | abc=ba, cac=1⟩

Completion settings:

• Reduction order:
  • Left-to-right recursive path with deg(b) = deg(c) = 0, b < c; deg(a) = 1

Axiom: abc=ba.

Flip LHS and RHS.

Defines rule #3.

Referenced by [5].

Axiom: cac=1.

Referenced by [3], [4], [7].

Overlap of [2] cac=1 with [2] cac=1:

Critical pair: ca=ac.

Defines rule #4.

Referenced by [4], [6].

Overlap of [2] cac=1 with [3] ca=ac:

Critical pair: acc=1.

Defines rule #2.

Referenced by [5].

Overlap of [1] ba=abc with [4] acc=1:

Critical pair: b=abccc.

Flip LHS and RHS.

Referenced by [6].

Overlap of [3] ca=ac with [5] abccc=b:

Critical pair: cb=acbccc.

Flip LHS and RHS.

Referenced by [7].

Overlap of [2] cac=1 with [6] acbccc=cb:

Critical pair: ccb=bccc.

Flip LHS and RHS.

Defines rule #1.