Certificate for #7578 ⟨a, b, c | ab=1, caac=bb⟩

Completion settings:

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

Axiom: ab=1.

Referenced by [3], [5].

Axiom: caac=bb.

Flip LHS and RHS.

Referenced by [3], [4].

Overlap of [1] ab=1 with [2] bb=caac:

Critical pair: acaac=b.

Flip LHS and RHS.

Defines rule #3.

Referenced by [4], [5].

Overlap of [2] bb=caac with [2] bb=caac:

Critical pair: bcaac=caacb.

Reduce LHS:

Reduce RHS:

Flip LHS and RHS.

Referenced by [6].

Overlap of [1] ab=1 with [3] b=acaac:

Critical pair: aacaac=1.

Defines rule #1.

Referenced by [6].

Overlap of [4] caacacaac=acaaccaac with [5] aacaac=1:

Critical pair: caacac=acaaccaacaac.

Reduce RHS:

Defines rule #2.