Certificate for #2037 ⟨a, b, c | aaaa=1, abcc=1⟩

Completion settings:

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

Axiom: aaaa=1.

Referenced by [3], [4].

Axiom: abcc=1.

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

Overlap of [1] aaaa=1 with [2] abcc=1:

Critical pair: aaa=bcc.

Referenced by [4], [5].

Overlap of [1] aaaa=1 with [3] aaa=bcc:

Critical pair: bcca=1.

Referenced by [6].

Overlap of [3] aaa=bcc with [2] abcc=1:

Critical pair: aa=bccbcc.

Referenced by [6].

Overlap of [4] bcca=1 with [5] aa=bccbcc:

Critical pair: bccbccbcc=a.

Flip LHS and RHS.

Defines rule #2.

Referenced by [7].

Overlap of [2] abcc=1 with [6] a=bccbccbcc:

Critical pair: bccbccbccbcc=1.

Defines rule #1.