Certificate for #8691 ⟨a, b | aa=b, abbbbb=b⟩

Completion settings:

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

[1] b=aa

Axiom: aa=b.

Flip LHS and RHS.

Defines rule #2.

Referenced by [2].

[2] aaaaaaaaaaa=aa

Axiom: abbbbb=b.

Reduce LHS:

[1]	a(b)bbbb
[1]	⇒ aaa(b)bbb
[1]	⇒ aaaaa(b)bb
[1]	⇒ aaaaaaa(b)b
[1]	⇒ aaaaaaaaa(b)
	⇒ aaaaaaaaaaa

Reduce RHS:

[1]	(b)
	⇒ aa

Defines rule #1.