Morphocompletion for #4808 ⟨a, b | abaabbba=bab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaabbba ⇒ bab
2.	abaabbbbab ⇒ babbaabbba
3.	babbaabbbaaabbba ⇒ abaabbbbbab
4.	abaabbabaabbbbbab ⇒ babbbaabbbaaabbba
5.	abaabbbbbabbaabbba ⇒ babbaabbbaaabbbbab
6.	babbbaabbbaaabbbaaabbba ⇒ abaabbabaabbbbbbab
7.	babbaabbbaabbaabbbaaabbba ⇒ abaabbbbaabaabbbbbab
8.	babbaabbbaaabbbbabbaabbba ⇒ abaabbbbbabbaabbbbab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] ba, [2/2] ab, [2/3] aa
Length 3:	[3/0] bba, [3/1] abb, [3/2] bbb, [3/3] aab, [3/4] baa, [3/5] bab, [3/6] aba
Length 4:	[4/0] bbba, [4/1] aabb, [4/2] abbb, [4/3] baab, [4/4] bbaa, [4/5] babb, [4/6] abaa
Length 5:	[5/0] abbba, [5/1] aabbb, [5/2] baabb, [5/3] abaab, [5/4] babba, [5/5] bbaab, [5/6] bbbaa
Length 6:	[6/0] aabbba, [6/1] baabbb, [6/2] abaabb, [6/3] bbaabb, [6/4] babbaa, [6/5] abbbaa, [6/6] bbbbab
Length 7:	[7/0] baabbba, [7/1] babbaab, [7/2] bbaabbb, [7/3] abaabbb, [7/4] aaabbba, [7/5] abbaabb, [7/6] aabbbaa

Considering [length 5 / frequency 0] abbba=c.

Reduction order:
- Left-to-right recursive path with deg(c) = deg(a) = 0, c < a; deg(b) = 1
Auxiliary generators:
1. abbba=c

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