Certificate for #3257 ⟨a, b, c | bb=aa, accc=1⟩

Completion settings:

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

Axiom: bb=aa.

Flip LHS and RHS.

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

Axiom: accc=1.

Referenced by [4], [6].

Overlap of [1] aa=bb with [1] aa=bb:

Critical pair: abb=bba.

Flip LHS and RHS.

Referenced by [7].

Overlap of [1] aa=bb with [2] accc=1:

Critical pair: a=bbccc.

Defines rule #4.

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

Overlap of [1] aa=bb with [4] a=bbccc:

Critical pair: bbccca=bb.

Reduce LHS:

Defines rule #3.

Overlap of [2] accc=1 with [4] a=bbccc:

Critical pair: bbcccccc=1.

Defines rule #2.

Simplify [3] bba=abb.

Reduce LHS:

Reduce RHS:

Defines rule #1.