Certificate for #5249 ⟨a, b, c | aa=b, bcbc=c⟩

Completion settings:

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

Axiom: aa=b.

Flip LHS and RHS.

Defines rule #3.

Referenced by [2].

Axiom: bcbc=c.

Reduce LHS:

Referenced by [3], [4].

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

Critical pair: aacc=caac.

Flip LHS and RHS.

Defines rule #1.

Referenced by [4].

Overlap of [2] aacaac=c with [3] caac=aacc:

Critical pair: aaaacc=c.

Defines rule #2.