Certificate for #6077 ⟨a, b, c | ab=c, bbc=ba⟩

Completion settings:

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

Axiom: ab=c.

Defines rule #5.

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

Axiom: bbc=ba.

Flip LHS and RHS.

Defines rule #6.

Referenced by [3], [4].

Overlap of [1] ab=c with [2] ba=bbc:

Critical pair: abbc=ca.

Reduce LHS:

Flip LHS and RHS.

Defines rule #7.

Referenced by [5].

Overlap of [2] ba=bbc with [1] ab=c:

Critical pair: bc=bbcb.

Flip LHS and RHS.

Defines rule #1.

Referenced by [6].

Overlap of [3] ca=cbc with [1] ab=c:

Critical pair: cc=cbcb.

Flip LHS and RHS.

Defines rule #3.

Referenced by [6], [7].

Overlap of [4] bbcb=bc with [5] cbcb=cc:

Critical pair: bbcc=bccb.

Flip LHS and RHS.

Defines rule #2.

Overlap of [5] cbcb=cc with [5] cbcb=cc:

Critical pair: cbcc=cccb.

Flip LHS and RHS.

Defines rule #4.