Certificate for #4984 ⟨a, b | aaaabba=abab⟩

Completion settings:

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

Axiom: aaaabba=abab.

Referenced by [3].

Axiom: abab=c.

Defines rule #1.

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

Simplify [1] aaaabba=abab.

Reduce RHS:

Defines rule #2.

Referenced by [5], [6].

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

Critical pair: abc=cab.

Flip LHS and RHS.

Defines rule #3.

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

Critical pair: aaaabbc=caaabba.

Flip LHS and RHS.

Defines rule #5.

Overlap of [3] aaaabba=c with [2] abab=c:

Critical pair: aaaabbc=cbab.

Flip LHS and RHS.

Defines rule #4.