Certificate for #14395 ⟨a, b | aaaa=b, abbbb=a⟩

Completion settings:

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

[1] b=aaaa

Axiom: aaaa=b.

Flip LHS and RHS.

Defines rule #2.

Referenced by [2].

[2] aaaaaaaaaaaaaaaaa=a

Axiom: abbbb=a.

Reduce LHS:

[1]	a(b)bbb
[1]	⇒ aaaaa(b)bb
[1]	⇒ aaaaaaaaa(b)b
[1]	⇒ aaaaaaaaaaaaa(b)
	⇒ aaaaaaaaaaaaaaaaa

Defines rule #1.