Certificate for #1326 ⟨a, b, c | ab=1, acca=c⟩

Completion settings:

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

Axiom: ab=1.

Defines rule #3.

Referenced by [3].

Axiom: acca=c.

Defines rule #1.

Referenced by [3], [4].

Overlap of [2] acca=c with [1] ab=1:

Critical pair: acc=cb.

Flip LHS and RHS.

Defines rule #4.

Overlap of [2] acca=c with [2] acca=c:

Critical pair: accc=ccca.

Flip LHS and RHS.

Defines rule #2.