Certificate for #2186 ⟨a, b | aaabbaa=abb⟩

Completion settings:

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

Axiom: aaabbaa=abb.

Referenced by [3].

Axiom: abb=c.

Defines rule #4.

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

Simplify [1] aaabbaa=abb.

Reduce RHS:

Referenced by [4].

Overlap of [3] aaabbaa=c with [2] abb=c:

Critical pair: aacaa=c.

Defines rule #2.

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

Overlap of [4] aacaa=c with [2] abb=c:

Critical pair: aacac=cbb.

Flip LHS and RHS.

Defines rule #5.

Overlap of [4] aacaa=c with [4] aacaa=c:

Critical pair: aacc=ccaa.

Flip LHS and RHS.

Defines rule #1.

Overlap of [4] aacaa=c with [4] aacaa=c:

Critical pair: aacac=cacaa.

Flip LHS and RHS.

Defines rule #3.