Certificate for #5429 ⟨a, b, c | ab=a, cacc=b⟩

Completion settings:

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

Axiom: ab=a.

Referenced by [3].

Axiom: cacc=b.

Flip LHS and RHS.

Defines rule #2.

Referenced by [3].

Overlap of [1] ab=a with [2] b=cacc:

Critical pair: acacc=a.

Defines rule #1.