Certificate for #6037 ⟨a, b, c | ab=c, aca=bc⟩

Completion settings:

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

Axiom: ab=c.

Flip LHS and RHS.

Defines rule #3.

Referenced by [2].

Axiom: aca=bc.

Reduce LHS:

[1]	a(c)a
	⇒ aaba

Reduce RHS:

[1]	b(c)
	⇒ bab

Defines rule #1.

Referenced by [3].

aab a aaba

Critical pair: aabbab=bababa.

Defines rule #2.