Certificate for #6039 ⟨a, b, c | ab=c, aca=cb⟩

Completion settings:

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

Axiom: ab=c.

Flip LHS and RHS.

Defines rule #1.

Referenced by [2].

Axiom: aca=cb.

Reduce LHS:

[1]	a(c)a
	⇒ aaba

Reduce RHS:

[1]	(c)b
	⇒ abb

Flip LHS and RHS.

Defines rule #2.