Certificate for #875 ⟨a, b | aaaaaba=ab⟩

Completion settings:

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

Axiom: aaaaaba=ab.

Referenced by [3].

Axiom: ab=c.

Defines rule #4.

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

Simplify [1] aaaaaba=ab.

Reduce RHS:

Referenced by [4].

Overlap of [3] aaaaaba=c with [2] ab=c:

Critical pair: aaaaca=c.

Defines rule #2.

Referenced by [5], [6].

Overlap of [4] aaaaca=c with [2] ab=c:

Critical pair: aaaacc=cb.

Flip LHS and RHS.

Referenced by [7].

Overlap of [4] aaaaca=c with [4] aaaaca=c:

Critical pair: aaaacc=caaaca.

Defines rule #1.

Referenced by [7].

Simplify [5] cb=aaaacc.

Reduce RHS:

Defines rule #3.