Morphocompletion for #5274 ⟨a, b | aabbbba=baab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabbbba ⇒ baab
2.	aabbbbbaab ⇒ baababbbba
3.	baababbbbabbba ⇒ aabbbbbbaab
4.	aabbbaabbbbbbaab ⇒ baabababbbbabbba
5.	aabbbbbbaababbbba ⇒ baababbbbabbbbaab
6.	baabababbbbabbbabbba ⇒ aabbbaabbbbbbbaab
7.	baababbbbaaababbbbabbba ⇒ aabbbbbaaaabbbbbbaab
8.	baababbbbabbbbaababbbba ⇒ aabbbbbbaababbbbbaab
	...

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] aab, [3/3] abb, [3/4] baa, [3/5] bab, [3/6] aba
Length 4:	[4/0] bbba, [4/1] bbbb, [4/2] abbb, [4/3] baab, [4/4] babb, [4/5] aabb, [4/6] abab
Length 5:	[5/0] bbbba, [5/1] abbbb, [5/2] babbb, [5/3] baaba, [5/4] aabbb, [5/5] abbba, [5/6] ababb
Length 6:	[6/0] abbbba, [6/1] baabab, [6/2] babbbb, [6/3] aabbbb, [6/4] ababbb, [6/5] babbba, [6/6] bbbaab
Length 7:	[7/0] babbbba, [7/1] baababb, [7/2] ababbbb, [7/3] bbabbba, [7/4] bbbbaab, [7/5] aababbb, [7/6] bbbabbb

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

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

Rewriting system is complete. See ⟨a, b | aabbbba=baab⟩.