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

Referenced by [3].

Axiom: abb=c.

Defines rule #6.

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

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

Critical pair: abaca=ab.

Defines rule #4.

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

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

Critical pair: abacc=abbb.

Reduce RHS:

Flip LHS and RHS.

Defines rule #5.

Overlap of [3] abaca=ab with [3] abaca=ab:

Critical pair: abacab=abbaca.

Reduce LHS:

Reduce RHS:

Flip LHS and RHS.

Defines rule #2.

Referenced by [6], [7].

Overlap of [3] abaca=ab with [5] caca=c:

Critical pair: abac=abca.

Flip LHS and RHS.

Defines rule #3.

Overlap of [5] caca=c with [5] caca=c:

Critical pair: cac=cca.

Flip LHS and RHS.

Defines rule #1.