Certificate for #19899 ⟨a, b | aaa=b, abbb=bbb⟩

Completion settings:

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

[1] b=aaa

Axiom: aaa=b.

Flip LHS and RHS.

Defines rule #2.

Referenced by [2].

[2] aaaaaaaaaa=aaaaaaaaa

Axiom: abbb=bbb.

Reduce LHS:

[1]	a(b)bb
[1]	⇒ aaaa(b)b
[1]	⇒ aaaaaaa(b)
	⇒ aaaaaaaaaa

Reduce RHS:

[1]	(b)bb
[1]	⇒ aaa(b)b
[1]	⇒ aaaaaa(b)
	⇒ aaaaaaaaa

Defines rule #1.