Certificate for #5786 ⟨a, b | aabbba=abaab⟩

Completion settings:

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

Axiom: aabbba=abaab.

Flip LHS and RHS.

Referenced by [2], [3].

Axiom: abaab=c.

Reduce LHS:

Defines rule #5.

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

Simplify [1] abaab=aabbba.

Reduce RHS:

Defines rule #6.

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

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

Critical pair: abac=caab.

Flip LHS and RHS.

Defines rule #2.

Overlap of [3] abaab=c with [2] aabbba=c:

Critical pair: abc=cbba.

Flip LHS and RHS.

Defines rule #1.

Overlap of [2] aabbba=c with [3] abaab=c:

Critical pair: aabbbc=cbaab.

Flip LHS and RHS.

Defines rule #4.

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

Critical pair: aabbbc=cabbba.

Flip LHS and RHS.

Defines rule #3.