Certificate for #1536 ⟨a, b, c | ab=1, cac=ca⟩

Completion settings:

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

Axiom: ab=1.

Defines rule #2.

Referenced by [6], [9].

Axiom: cac=ca.

Referenced by [4].

Axiom: ca=d.

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

Simplify [2] cac=ca.

Reduce RHS:

Referenced by [5].

Overlap of [4] cac=d with [3] ca=d:

Critical pair: dc=d.

Referenced by [7].

Overlap of [3] ca=d with [1] ab=1:

Critical pair: c=db.

Defines rule #5.

Referenced by [8].

Overlap of [5] dc=d with [3] ca=d:

Critical pair: dd=da.

Flip LHS and RHS.

Defines rule #3.

Referenced by [9].

Overlap of [3] ca=d with [6] c=db:

Critical pair: dba=d.

Defines rule #4.

Overlap of [7] da=dd with [1] ab=1:

Critical pair: d=ddb.

Flip LHS and RHS.

Defines rule #1.