Certificate for #3019 ⟨a, b, c | aba=a, bcb=a⟩

Completion settings:

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

Axiom: aba=a.

Referenced by [3].

Axiom: bcb=a.

Flip LHS and RHS.

Defines rule #2.

Referenced by [3], [4].

Simplify [1] aba=a.

Reduce RHS:

Referenced by [4].

Overlap of [3] aba=bcb with [2] a=bcb:

Critical pair: bcbba=bcb.

Reduce LHS:

Defines rule #1.