Certificate for #6011 ⟨a, b, c | ab=c, aac=ca⟩

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: aac=ca.

Reduce LHS:

[1]	aa(c)
	⇒ aaab

Reduce RHS:

[1]	(c)a
	⇒ aba

Defines rule #1.