Morphocompletion for #4857 ⟨a, b | abbaaaab=baa⟩

Solved by morph:2/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbaaaab ⇒ baa
2.	baabaaaab ⇒ abbaaabaa
3.	abbaaaaabbaaabaa ⇒ baaaabaaaab
4.	abbaaabaaaabaaaab ⇒ baabaaaaabbaaabaa
5.	baaaabaaaabbbaaaab ⇒ abbaaaaabbaaababaa
6.	ababbaaaaabbaaababaa ⇒ baaaaaabbbaaaab
7.	abbaaabaaaaaabbbaaaab ⇒ baaabbaaaaabbaaababaa
8.	baaaaaabbbaaaabbbaaaab ⇒ ababbaaaaabbaaabababaa
9.	abbaaabaabaaaaabbaaabaa ⇒ baabaaabaaaabaaaab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba, [2/3] bb
Length 3:	[3/0] aaa, [3/1] baa, [3/2] aab, [3/3] abb, [3/4] aba, [3/5] bba, [3/6] bbb
Length 4:	[4/0] aaab, [4/1] baaa, [4/2] aaaa, [4/3] abba, [4/4] abaa, [4/5] bbaa, [4/6] aaba
Length 5:	[5/0] aaaab, [5/1] baaaa, [5/2] abbaa, [5/3] bbaaa, [5/4] aabaa, [5/5] aaaba, [5/6] aaaaa
Length 6:	[6/0] baaaab, [6/1] abbaaa, [6/2] aaabaa, [6/3] aaaabb, [6/4] bbaaaa, [6/5] aabaaa, [6/6] abaaaa
Length 7:	[7/0] abbaaab, [7/1] bbaaaab, [7/2] baaabaa, [7/3] aabaaaa, [7/4] abaaaab, [7/5] bbaaaba, [7/6] aaaaabb

Considering [length 2 / frequency 0] aa=c.

Reduction order:
- Right-to-left recursive path with deg(b) = deg(c) = 0, b < c; deg(a) = 1
Auxiliary generators:
1. aa=c

Rewriting system is complete. See ⟨a, b | abbaaaab=baa⟩.