Certificate for #1932 ⟨a, b | aaabbbba=ab⟩

Completion settings:

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

Axiom: aaabbbba=ab.

Referenced by [3].

Axiom: bbbba=c.

Defines rule #7.

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

Overlap of [1] aaabbbba=ab with [2] bbbba=c:

Critical pair: aaac=ab.

Flip LHS and RHS.

Defines rule #5.

Referenced by [4], [5].

Overlap of [2] bbbba=c with [3] ab=aaac:

Critical pair: bbbbaaac=cb.

Reduce LHS:

Flip LHS and RHS.

Defines rule #6.

Referenced by [5], [6].

Overlap of [3] ab=aaac with [2] bbbba=c:

Critical pair: ac=aaacbbba.

Reduce RHS:

Flip LHS and RHS.

Defines rule #3.

Referenced by [7].

Overlap of [4] cb=caac with [2] bbbba=c:

Critical pair: cc=caacbbba.

Reduce RHS:

Flip LHS and RHS.

Defines rule #4.

Referenced by [7], [8].

Overlap of [5] aaacaacaacaaca=ac with [6] caacaacaacaaca=cc:

Critical pair: aaacc=acaca.

Defines rule #1.

Overlap of [6] caacaacaacaaca=cc with [6] caacaacaacaaca=cc:

Critical pair: caacc=ccaca.

Defines rule #2.