Certificate for #5351 ⟨a, b, c | ab=a, baca=c⟩

Completion settings:

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

Axiom: ab=a.

Defines rule #2.

Referenced by [3], [4].

Axiom: baca=c.

Defines rule #4.

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

Overlap of [1] ab=a with [2] baca=c:

Critical pair: ac=aaca.

Flip LHS and RHS.

Defines rule #6.

Overlap of [2] baca=c with [1] ab=a:

Critical pair: baca=cb.

Reduce LHS:

Flip LHS and RHS.

Defines rule #1.

Referenced by [5].

Overlap of [4] cb=c with [2] baca=c:

Critical pair: cc=caca.

Flip LHS and RHS.

Defines rule #5.

Referenced by [6].

Overlap of [2] baca=c with [5] caca=cc:

Critical pair: bacc=cca.

Flip LHS and RHS.

Defines rule #3.