Certificate for #1576 ⟨a, b, c | aaa=bb, bcc=1⟩

Completion settings:

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

Axiom: aaa=bb.

Flip LHS and RHS.

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

Axiom: bcc=1.

Referenced by [4], [6].

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

Critical pair: baaa=aaab.

Flip LHS and RHS.

Referenced by [7].

Overlap of [1] bb=aaa with [2] bcc=1:

Critical pair: b=aaacc.

Defines rule #4.

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

Overlap of [1] bb=aaa with [4] b=aaacc:

Critical pair: aaaccb=aaa.

Reduce LHS:

Defines rule #3.

Overlap of [2] bcc=1 with [4] b=aaacc:

Critical pair: aaacccc=1.

Defines rule #1.

Simplify [3] aaab=baaa.

Reduce LHS:

Reduce RHS:

Defines rule #2.