Certificate for #6103 ⟨a, b, c | ab=c, cac=bc⟩

Completion settings:

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

Axiom: ab=c.

Defines rule #4.

Referenced by [3].

Axiom: cac=bc.

Flip LHS and RHS.

Defines rule #3.

Referenced by [3].

Overlap of [1] ab=c with [2] bc=cac:

Critical pair: acac=cc.

Defines rule #2.

Referenced by [4].

Overlap of [3] acac=cc with [3] acac=cc:

Critical pair: accc=ccac.

Defines rule #1.