Certificate for #2009 ⟨a, b, c | abc=ca, bab=1⟩

Completion settings:

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

Axiom: abc=ca.

Referenced by [5], [6].

Axiom: bab=1.

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

Overlap of [2] bab=1 with [2] bab=1:

Critical pair: ba=ab.

Defines rule #1.

Referenced by [4].

Overlap of [2] bab=1 with [3] ba=ab:

Critical pair: abb=1.

Defines rule #2.

Referenced by [7].

Overlap of [2] bab=1 with [1] abc=ca:

Critical pair: bca=c.

Referenced by [6], [7].

Overlap of [1] abc=ca with [5] bca=c:

Critical pair: ac=caa.

Defines rule #3.

Overlap of [5] bca=c with [4] abb=1:

Critical pair: bc=cbb.

Defines rule #4.