Certificate for #7611 ⟨a, b, c | ab=1, cbcc=cb⟩

Completion settings:

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

Axiom: ab=1.

Defines rule #2.

Axiom: cbcc=cb.

Referenced by [4].

Axiom: cb=d.

Defines rule #3.

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

Simplify [2] cbcc=cb.

Reduce RHS:

Referenced by [5].

Overlap of [4] cbcc=d with [3] cb=d:

Critical pair: dcc=d.

Defines rule #1.

Referenced by [6].

Overlap of [5] dcc=d with [3] cb=d:

Critical pair: dcd=db.

Flip LHS and RHS.

Defines rule #4.