Certificate for #5581 ⟨a, b, c | ab=c, bbca=c⟩

Completion settings:

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

Axiom: ab=c.

Flip LHS and RHS.

Defines rule #2.

Referenced by [2].

Axiom: bbca=c.

Reduce LHS:

[1]	bb(c)a
	⇒ bbaba

Reduce RHS:

[1]	(c)
	⇒ ab

Defines rule #1.