Certificate for #906 ⟨a, b | aaababa=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: aaababa=ab.

Referenced by [3].

Axiom: ab=c.

Defines rule #4.

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

Simplify [1] aaababa=ab.

Reduce RHS:

Referenced by [4].

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

Critical pair: aacaba=c.

Reduce LHS:

Defines rule #2.

Referenced by [5], [6].

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

Critical pair: aaccc=cb.

Flip LHS and RHS.

Referenced by [7].

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

Critical pair: aaccc=cacca.

Defines rule #1.

Referenced by [7].

Simplify [5] cb=aaccc.

Reduce RHS:

Defines rule #3.