Morphocompletion for #5404 ⟨a, b | abbabba=baab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbbaab ⇒ baabbba
2.	abbabba ⇒ baab
3.	baabbbababba ⇒ abbbabaab
4.	abbbabaabbba ⇒ baabbbabbaab
5.	abbbababaabbba ⇒ baabbbabbaabab
6.	abbababbbabaab ⇒ baababbbababba
7.	baabbbabbababba ⇒ abbabbbabaab
8.	abbbabababaabbba ⇒ baabbbabbaababab
9.	baabbbaaabbbababba ⇒ abbbaaabbbabaab
10.	baabbbabbaabbbabba ⇒ abbbabaabbbbaab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] bb, [2/3] aa
Length 3:	[3/0] bba, [3/1] abb, [3/2] bab, [3/3] baa, [3/4] bbb, [3/5] aab, [3/6] aba
Length 4:	[4/0] abbb, [4/1] bbba, [4/2] abba, [4/3] baab, [4/4] bbab, [4/5] baba, [4/6] aabb
Length 5:	[5/0] abbba, [5/1] baabb, [5/2] babba, [5/3] bbbab, [5/4] aabbb, [5/5] bbaba, [5/6] babab
Length 6:	[6/0] abbbab, [6/1] baabbb, [6/2] aabbba, [6/3] bbabab, [6/4] bbabba, [6/5] bbbaba, [6/6] ababba
Length 7:	[7/0] baabbba, [7/1] abbbaba, [7/2] bababba, [7/3] aabbbab, [7/4] bbababb, [7/5] bbbabab, [7/6] bbbabba

Considering [length 3 / frequency 0] bba=c.

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

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