Certificate for #136 ⟨a, b, c | aa=a, bc=a⟩

Completion settings:

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

Axiom: aa=a.

Referenced by [3].

Axiom: bc=a.

Flip LHS and RHS.

Defines rule #2.

Referenced by [3], [4].

Simplify [1] aa=a.

Reduce RHS:

[2]	(a)
	⇒ bc

Referenced by [4].

Overlap of [3] aa=bc with [2] a=bc:

aa a

Critical pair: bca=bc.

Reduce LHS:

[2]	bc(a)
	⇒ bcbc

Defines rule #1.