Certificate for #5941 ⟨a, b | abbbba=babab⟩

Completion settings:

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

Axiom: abbbba=babab.

Flip LHS and RHS.

Referenced by [2], [3].

Axiom: babab=c.

Reduce LHS:

Defines rule #5.

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

Simplify [1] babab=abbbba.

Reduce RHS:

Defines rule #6.

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

Overlap of [3] babab=c with [3] babab=c:

Critical pair: bac=cab.

Flip LHS and RHS.

Defines rule #1.

Overlap of [3] babab=c with [2] abbbba=c:

Critical pair: babc=cbbba.

Flip LHS and RHS.

Defines rule #3.

Overlap of [2] abbbba=c with [3] babab=c:

Critical pair: abbbc=cbab.

Flip LHS and RHS.

Defines rule #2.

Overlap of [2] abbbba=c with [2] abbbba=c:

Critical pair: abbbbc=cbbbba.

Flip LHS and RHS.

Defines rule #4.