Certificate for #5245 ⟨a, b, c | aa=b, bcac=b⟩

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: bcac=b.

Reduce LHS:

[1]	(b)cac
	⇒ aacac

Reduce RHS:

[1]	(b)
	⇒ aa

Defines rule #1.