Morphocompletion for #3217 ⟨a, b | abaabbabaab=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.	abaab ⇒ babaa
2.	bbabaaab ⇒ aabbbaba
3.	bbabaaaba ⇒ aabbbabaa
4.	babaaaab ⇒ abababaa
5.	baabbbabaaa ⇒ 1
6.	aabbbabaaab ⇒ 1
7.	baabbabababaa ⇒ ab
8.	bbabaaabbabaa ⇒ aabbbabababaa
9.	baabbababbabaa ⇒ abb
10.	baabbababbbabaa ⇒ abbb
11.	baabbababbbbabaa ⇒ abbbb
12.	baaaabbbababbaba ⇒ abbab
13.	babaaabaaaab ⇒ abaaabababaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] aa, [2/3] bb
Length 3:	[3/0] baa, [3/1] aba, [3/2] bab, [3/3] aab, [3/4] bba, [3/5] aaa, [3/6] abb
Length 4:	[4/0] baba, [4/1] abaa, [4/2] bbab, [4/3] aaab, [4/4] baab, [4/5] baaa, [4/6] aabb
Length 5:	[5/0] babaa, [5/1] bbaba, [5/2] baabb, [5/3] abaaa, [5/4] baaab, [5/5] abbab, [5/6] babab
Length 6:	[6/0] bbabaa, [6/1] babaaa, [6/2] baabba, [6/3] abbaba, [6/4] abaaab, [6/5] baaaab, [6/6] aabbab
Length 7:	[7/0] bbabaaa, [7/1] babaaab, [7/2] baabbab, [7/3] bbbabaa, [7/4] aabbaba, [7/5] abaaaab, [7/6] abbabaa

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

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

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