Certificate for #5651 ⟨a, b | aabaab=aabba⟩

Completion settings:

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

Axiom: aabaab=aabba.

Referenced by [3].

Axiom: aabba=c.

Defines rule #1.

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

Simplify [1] aabaab=aabba.

Reduce RHS:

Defines rule #2.

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

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

Critical pair: aabbc=cabba.

Flip LHS and RHS.

Defines rule #5.

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

Critical pair: aabc=caab.

Flip LHS and RHS.

Defines rule #4.

Overlap of [3] aabaab=c with [2] aabba=c:

Critical pair: aabc=cba.

Flip LHS and RHS.

Defines rule #3.

Overlap of [2] aabba=c with [3] aabaab=c:

Critical pair: aabbc=cabaab.

Flip LHS and RHS.

Defines rule #6.