Certificate for #2076 ⟨a, b | abbaabba=ab⟩

Completion settings:

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

Axiom: abbaabba=ab.

Referenced by [3].

Axiom: abb=c.

Referenced by [3], [4].

Overlap of [1] abbaabba=ab with [2] abb=c:

Critical pair: caabba=ab.

Reduce LHS:

Flip LHS and RHS.

Defines rule #3.

Referenced by [4], [5].

Overlap of [2] abb=c with [3] ab=caca:

Critical pair: cacab=c.

Reduce LHS:

Defines rule #2.

Referenced by [5], [6].

Overlap of [4] caccaca=c with [3] ab=caca:

Critical pair: caccaccaca=cb.

Reduce LHS:

Flip LHS and RHS.

Defines rule #4.

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

Critical pair: caccac=cccaca.

Flip LHS and RHS.

Defines rule #1.