Certificate for #1080 ⟨a, b, c | aa=1, abbcc=1⟩

Completion settings:

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

Axiom: aa=1.

Referenced by [3], [4].

Axiom: abbcc=1.

Referenced by [3].

Overlap of [1] aa=1 with [2] abbcc=1:

Critical pair: a=bbcc.

Defines rule #2.

Referenced by [4].

Overlap of [1] aa=1 with [3] a=bbcc:

Critical pair: bbcca=1.

Reduce LHS:

Defines rule #1.