Morphocompletion for #4850 ⟨a, b | ababbbba=bab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	ababbbba ⇒ bab
2.	ababbbbbab ⇒ babbabbbba
3.	babbabbbbaabbbba ⇒ ababbbbbbab
4.	ababbbababbbbbbab ⇒ babbbabbbbaabbbba
5.	ababbbbbbabbabbbba ⇒ babbabbbbaabbbbbab
6.	babbbabbbbaabbbbaabbbba ⇒ ababbbababbbbbbbab
7.	babbabbbbaabbabbbbaabbbba ⇒ ababbbbbaababbbbbbab
8.	babbabbbbaabbbbbabbabbbba ⇒ ababbbbbbabbabbbbbab
	...

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] bbb, [3/1] bba, [3/2] bab, [3/3] abb, [3/4] aba, [3/5] aab, [3/6] baa
Length 4:	[4/0] bbba, [4/1] bbbb, [4/2] babb, [4/3] abbb, [4/4] bbab, [4/5] abab, [4/6] aabb
Length 5:	[5/0] bbbba, [5/1] abbbb, [5/2] babbb, [5/3] bbabb, [5/4] ababb, [5/5] bbbab, [5/6] babba
Length 6:	[6/0] abbbba, [6/1] babbbb, [6/2] ababbb, [6/3] babbab, [6/4] bbabbb, [6/5] bbbbab, [6/6] abbabb
Length 7:	[7/0] babbbba, [7/1] babbabb, [7/2] bbabbbb, [7/3] ababbbb, [7/4] aabbbba, [7/5] bbbbbab, [7/6] abbabbb

Considering [length 6 / frequency 0] abbbba=c.

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

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