Certificate for #3041 ⟨a, b, c | aba=b, cac=b⟩

Completion settings:

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

Axiom: aba=b.

Defines rule #1.

Referenced by [3], [5].

Axiom: cac=b.

Defines rule #5.

Referenced by [4].

Overlap of [1] aba=b with [1] aba=b:

Critical pair: abb=bba.

Flip LHS and RHS.

Defines rule #2.

Overlap of [2] cac=b with [2] cac=b:

Critical pair: cab=bac.

Flip LHS and RHS.

Defines rule #4.

Referenced by [5].

Overlap of [1] aba=b with [4] bac=cab:

Critical pair: acab=bc.

Flip LHS and RHS.

Defines rule #3.