Morphocompletion for #3252 ⟨a, b | ababbaaabba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbaab ⇒ babbaa
2.	abbaaabb ⇒ baababba
3.	babbaaabb ⇒ bbaababba
4.	bbabbaaaab ⇒ abbababbaa
5.	ababbaaab ⇒ bbaaabbaa
6.	abbaaabbab ⇒ baabbabbaa
7.	bbaababbaaa ⇒ 1
8.	babbaaabbaa ⇒ 1
9.	bbabbaaaaabb ⇒ abbabaababba
10.	abbaaabbbbaaabbaa ⇒ baabab
11.	abbaaabbbbaababbaa ⇒ baababb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] aa, [2/2] bb, [2/3] ba
Length 3:	[3/0] abb, [3/1] bba, [3/2] baa, [3/3] aab, [3/4] aaa, [3/5] bab, [3/6] aba
Length 4:	[4/0] bbaa, [4/1] abba, [4/2] aaab, [4/3] baaa, [4/4] aabb, [4/5] babb, [4/6] bbab
Length 5:	[5/0] abbaa, [5/1] bbaaa, [5/2] aaabb, [5/3] baaab, [5/4] babba, [5/5] bbaab, [5/6] ababb
Length 6:	[6/0] abbaaa, [6/1] babbaa, [6/2] baaabb, [6/3] bbaaab, [6/4] aabbaa, [6/5] ababba, [6/6] bbabba
Length 7:	[7/0] abbaaab, [7/1] babbaaa, [7/2] bbaaabb, [7/3] ababbaa, [7/4] aaabbaa, [7/5] bbabbaa, [7/6] baaabba

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

Reduction order:
- Right-to-left recursive path with deg(b) = deg(c) = 0, b < c; deg(a) = 1
Auxiliary generators:
1. abbaa=c

Rewriting system is complete. See ⟨a, b | ababbaaabba=1⟩.