Certificate for #5100 ⟨a, b, c | ab=c, cacbc=1⟩

Completion settings:

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

Axiom: ab=c.

Flip LHS and RHS.

Defines rule #3.

Referenced by [2].

Axiom: cacbc=1.

Reduce LHS:

Referenced by [3], [4].

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

Critical pair: abaabb=aabbab.

Defines rule #1.

Referenced by [4].

Overlap of [2] abaabbab=1 with [3] abaabb=aabbab:

Critical pair: aabbabab=1.

Defines rule #2.