Certificate for #96 ⟨a, b, c | aa=b, bcc=1⟩

Completion settings:

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

Axiom: aa=b.

Flip LHS and RHS.

Defines rule #2.

Referenced by [2].

Axiom: bcc=1.

Reduce LHS:

[1]	(b)cc
	⇒ aacc

Defines rule #1.