Morphocompletion for #4780 ⟨a, b | abaaabba=bab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaaabba ⇒ bab
2.	babbaaabba ⇒ abaaabbbab
3.	abaaababaaabbbab ⇒ babbbaaabba
4.	babbbaaabbaaaabba ⇒ abaaababaaabbbbab
5.	abaaabbbabbbaaabba ⇒ babbaaababaaabbbab
6.	abaaababaaababaaabbbbab ⇒ babbbbaaabbaaaabba
7.	abaaababaaabbbaabaaabbbab ⇒ babbbaaabbaabbaaabba
8.	abaaabbbabbaaababaaabbbab ⇒ babbaaabbbabbbaaabba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] ba, [2/2] aa, [2/3] bb
Length 3:	[3/0] aba, [3/1] bba, [3/2] bab, [3/3] baa, [3/4] aab, [3/5] aaa, [3/6] abb
Length 4:	[4/0] abaa, [4/1] baaa, [4/2] aaab, [4/3] aabb, [4/4] abba, [4/5] bbab, [4/6] bbba
Length 5:	[5/0] abaaa, [5/1] baaab, [5/2] aaabb, [5/3] bbbab, [5/4] aabba, [5/5] abbba, [5/6] aabbb
Length 6:	[6/0] abaaab, [6/1] baaabb, [6/2] aaabba, [6/3] abbbab, [6/4] aaabbb, [6/5] aabbba, [6/6] babaaa
Length 7:	[7/0] abaaabb, [7/1] aabbbab, [7/2] baaabbb, [7/3] baaabba, [7/4] abaaaba, [7/5] aaabbba, [7/6] babaaab

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

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

Rewriting system is complete. See ⟨a, b | abaaabba=bab⟩.