Certificate for #2851 ⟨a, b, c | aaa=b, cbc=a⟩

Completion settings:

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

Axiom: aaa=b.

Flip LHS and RHS.

Defines rule #3.

Referenced by [2].

Axiom: cbc=a.

Reduce LHS:

Defines rule #2.

Referenced by [3].

Overlap of [2] caaac=a with [2] caaac=a:

Critical pair: caaaa=aaaac.

Defines rule #1.