Morphocompletion for #5405 ⟨a, b | abbabba=babb⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbabba ⇒ babb
2.	abbbabb ⇒ babbbba
3.	babbbbaabba ⇒ abbbbabb
4.	abbbbabbbba ⇒ babbbbababb
5.	babbbbabbaabba ⇒ abbabbbbabb
6.	abbababbbbabb ⇒ babbbbbbaabba
7.	babbbbbbaabbaabba ⇒ abbababbbbbabb
8.	babbbbaabbbbaabba ⇒ abbbababbbbabb
9.	babbbbababbbbabba ⇒ abbbbabbbbbabb
	...

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] abb, [3/1] bba, [3/2] bbb, [3/3] bab, [3/4] aab, [3/5] baa, [3/6] aba
Length 4:	[4/0] babb, [4/1] abba, [4/2] abbb, [4/3] bbbb, [4/4] bbba, [4/5] bbab, [4/6] aabb
Length 5:	[5/0] babbb, [5/1] abbbb, [5/2] bbbba, [5/3] aabba, [5/4] bbabb, [5/5] bbbab, [5/6] baabb
Length 6:	[6/0] babbbb, [6/1] abbbba, [6/2] baabba, [6/3] bbbabb, [6/4] bbaabb, [6/5] bbbbab, [6/6] bbabba
Length 7:	[7/0] babbbba, [7/1] bbaabba, [7/2] abbbbab, [7/3] bbbbabb, [7/4] bbbaabb, [7/5] bbbbaab, [7/6] bbbabba

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

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

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