Morphocompletion for #3115 ⟨a, b | aabbabaaaab=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbabaaaa ⇒ baaaabaab
2.	abaaaabaab ⇒ babaaaabaa
3.	aabbabaa ⇒ babaaaab
4.	aabaabb ⇒ bbabaaa
5.	bbabaaaabaa ⇒ 1
6.	abaabbab ⇒ baabbaba
7.	bbabaaababaaaabaa ⇒ aabaab
8.	aabbbbabaaaab ⇒ babaaaabbbaba
9.	aabbbaabbaba ⇒ babaaaabbbab
10.	aabbabbbabaaa ⇒ babaaaabbaabb
11.	bbabaaaabbaaaabaab ⇒ abaabba
12.	bbabaaaababbabaaa ⇒ abaabb
13.	bbabaaaabababaaaab ⇒ abbabaa
	...

Collecting factors up to length 7, frequency 4:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] aa, [2/1] ca, [2/2] ba, [2/3] ac, [2/4] ab, [2/5] bb, [2/6] cb
Length 3:	[3/0] aac, [3/1] aba, [3/2] aca, [3/3] aab, [3/4] baa, [3/5] aaa, [3/6] caa
Length 4:	[4/0] aaca, [4/1] baac, [4/2] caca, [4/3] baba, [4/4] acaa, [4/5] caaa, [4/6] abaa
Length 5:	[5/0] baaca, [5/1] acaaa, [5/2] aabaa, [5/3] aacaa, [5/4] caaac, [5/5] cacaa, [5/6] abaac

Considering [length 5 / frequency 0] baaca=d.

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

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