Morphocompletion for #3200 ⟨a, b | abaabaaaaab=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabaaaaab ⇒ abaabaaaa
2.	abaabaaaaab ⇒ 1
3.	aabaaaabaabaaaa ⇒ abaabaaaaaaaaab
4.	abaabaaaaaaaaabab ⇒ aabaaa
5.	aabaaababaabaaaa ⇒ aabaa
6.	aabaaaababaabaaaa ⇒ aabaaa
7.	aabaabababaabaaaa ⇒ aabaab
8.	aabaaaabababaabaaaa ⇒ aabaaaab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba
Length 3:	[3/0] aaa, [3/1] aab, [3/2] aba, [3/3] baa, [3/4] bab
Length 4:	[4/0] aaba, [4/1] aaaa, [4/2] abaa, [4/3] baaa, [4/4] aaab, [4/5] abab, [4/6] baab
Length 5:	[5/0] aabaa, [5/1] baaaa, [5/2] abaaa, [5/3] abaab, [5/4] baaba, [5/5] aaaab, [5/6] aaaaa
Length 6:	[6/0] aabaaa, [6/1] abaaaa, [6/2] abaaba, [6/3] baabaa, [6/4] aaabab, [6/5] aaaaab, [6/6] babaab
Length 7:	[7/0] aabaaaa, [7/1] abaabaa, [7/2] baabaaa, [7/3] ababaab, [7/4] babaaba, [7/5] aaaabab, [7/6] baaaaab

Considering [length 3 / frequency 2] aba=c.

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

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