Certificate for #4213 ⟨a, b, c | aab=1, acca=c⟩

Completion settings:

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

Axiom: aab=1.

Defines rule #4.

Referenced by [3].

Axiom: acca=c.

Defines rule #1.

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

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

Critical pair: acc=cab.

Flip LHS and RHS.

Defines rule #5.

Referenced by [5].

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

Critical pair: accc=ccca.

Flip LHS and RHS.

Defines rule #2.

Overlap of [2] acca=c with [3] cab=acc:

Critical pair: acacc=cb.

Flip LHS and RHS.

Defines rule #3.