Certificate for #4392 ⟨a, b | aaaaabaa=aab⟩

Completion settings:

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

Axiom: aaaaabaa=aab.

Referenced by [3].

Axiom: aab=c.

Defines rule #6.

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

Simplify [1] aaaaabaa=aab.

Reduce RHS:

Referenced by [4].

Overlap of [3] aaaaabaa=c with [2] aab=c:

Critical pair: aaacaa=c.

Defines rule #3.

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

Overlap of [4] aaacaa=c with [2] aab=c:

Critical pair: aaacc=cb.

Flip LHS and RHS.

Referenced by [9].

Overlap of [4] aaacaa=c with [2] aab=c:

Critical pair: aaacac=cab.

Flip LHS and RHS.

Referenced by [10].

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

Critical pair: aaacc=cacaa.

Defines rule #1.

Referenced by [9].

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

Critical pair: aaacac=caacaa.

Defines rule #2.

Referenced by [10].

Simplify [5] cb=aaacc.

Reduce RHS:

Defines rule #4.

Simplify [6] cab=aaacac.

Reduce RHS:

Defines rule #5.