Certificate for #5146 ⟨a, b, c | aa=a, bbbc=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: bbbc=a.

Flip LHS and RHS.

Defines rule #2.

Referenced by [3], [4].

Simplify [1] aa=a.

Reduce RHS:

[2]	(a)
	⇒ bbbc

Referenced by [4].

aa a

Critical pair: bbbca=bbbc.

Reduce LHS:

[2]	bbbc(a)
	⇒ bbbcbbbc

Defines rule #1.