Certificate for #7593 ⟨a, b, c | ab=1, cacc=bb⟩

Completion settings:

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

Axiom: ab=1.

Referenced by [3], [6].

Axiom: cacc=bb.

Flip LHS and RHS.

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

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

Critical pair: acacc=b.

Flip LHS and RHS.

Defines rule #4.

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

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

Critical pair: bcacc=caccb.

Reduce LHS:

Reduce RHS:

Defines rule #2.

Overlap of [2] bb=cacc with [3] b=acacc:

Critical pair: acaccb=cacc.

Reduce LHS:

Defines rule #3.

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

Critical pair: aacacc=1.

Defines rule #1.