Certificate for #2593 ⟨a, b | ababab=abaa⟩

Completion settings:

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

Axiom: ababab=abaa.

Referenced by [3].

Axiom: abaa=c.

Defines rule #5.

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

Simplify [1] ababab=abaa.

Reduce RHS:

Defines rule #6.

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

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

Critical pair: abac=cbaa.

Flip LHS and RHS.

Defines rule #3.

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

Critical pair: abc=cab.

Flip LHS and RHS.

Defines rule #1.

Overlap of [3] ababab=c with [2] abaa=c:

Critical pair: ababc=caa.

Flip LHS and RHS.

Defines rule #2.

Overlap of [2] abaa=c with [3] ababab=c:

Critical pair: abac=cbabab.

Flip LHS and RHS.

Defines rule #4.