Certificate for #5782 ⟨a, b, c | ab=a, aab=bc⟩

Completion settings:

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

Axiom: ab=a.

Defines rule #1.

Referenced by [2], [3].

Axiom: aab=bc.

Reduce LHS:

[1]	a(ab)
	⇒ aa

Flip LHS and RHS.

Defines rule #3.

Referenced by [3].

Overlap of [1] ab=a with [2] bc=aa:

a b bc

Critical pair: aaa=ac.

Flip LHS and RHS.

Defines rule #2.