Certificate for #5455 ⟨a, b, c | ab=a, cbcc=a⟩

Completion settings:

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

Axiom: ab=a.

Defines rule #1.

Referenced by [3].

Axiom: cbcc=a.

Defines rule #3.

Referenced by [3].

Overlap of [2] cbcc=a with [2] cbcc=a:

Critical pair: cbca=abcc.

Reduce RHS:

Flip LHS and RHS.

Defines rule #2.