Certificate for #1963 ⟨a, b | aabababa=ab⟩

Completion settings:

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

Axiom: aabababa=ab.

Referenced by [3].

Axiom: ab=c.

Defines rule #3.

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

Simplify [1] aabababa=ab.

Reduce RHS:

Referenced by [4].

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

Critical pair: acababa=c.

Reduce LHS:

Defines rule #1.

Referenced by [5], [6].

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

Critical pair: acccc=cb.

Flip LHS and RHS.

Defines rule #4.

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

Critical pair: acccc=cccca.

Flip LHS and RHS.

Defines rule #2.