Certificate for #4780 ⟨a, b | abaaabba=bab⟩

Completion settings:

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

Axiom: abaaabba=bab.

Referenced by [3].

Axiom: ab=c.

Defines rule #1.

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

Simplify [1] abaaabba=bab.

Reduce RHS:

Referenced by [4].

Overlap of [3] abaaabba=bc with [2] ab=c:

Critical pair: caaabba=bc.

Reduce LHS:

Defines rule #3.

Referenced by [5], [8].

Overlap of [4] caacba=bc with [2] ab=c:

Critical pair: caacbc=bcb.

Flip LHS and RHS.

Defines rule #5.

Referenced by [6], [7], [9], [10].

Overlap of [2] ab=c with [5] bcb=caacbc:

Critical pair: acaacbc=ccb.

Defines rule #2.

Referenced by [8], [9].

Overlap of [5] bcb=caacbc with [5] bcb=caacbc:

Critical pair: bccaacbc=caacbccb.

Defines rule #7.

Overlap of [6] acaacbc=ccb with [4] caacba=bc:

Critical pair: acaacbbc=ccbaacba.

Flip LHS and RHS.

Defines rule #8.

Overlap of [6] acaacbc=ccb with [5] bcb=caacbc:

Critical pair: acaaccaacbc=ccbb.

Flip LHS and RHS.

Defines rule #4.

Referenced by [10].

Overlap of [9] ccbb=acaaccaacbc with [5] bcb=caacbc:

Critical pair: ccbcaacbc=acaaccaacbccb.

Defines rule #6.