Morphocompletion for #2295 ⟨a, b | abaaaab=baa⟩

Solved by morph:4/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaaaab ⇒ baa
2.	baaaaaab ⇒ abaaabaa
3.	baaaaaaaabaab ⇒ abaaaaabaabaa
4.	abaaaaabaaabaa ⇒ baaaaaaaab
5.	baaaaaaaabbaaaab ⇒ abaaaaabaaababaa
6.	baaaaaaabaaabaa ⇒ abaaabaaaaaaaab
7.	baaaaaaaaaabaabaab ⇒ abaaaaabaaaaababaa
8.	abaaaaabaaaaabaabaa ⇒ baaaaaaaaaabaab
9.	baaaaaaaaaabaabbaaaab ⇒ abaaaaabaaaaabaababaa
10.	baaaaaaaabaaabaaabaa ⇒ abaaaaabaabaaaaaaaab
11.	baaaaaaabaaaaabaabaa ⇒ abaaabaaaaaaaaaabaab
12.	abaaaaabaaaaabaaababaa ⇒ baaaaaaaaaabbaaaab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ba, [2/2] ab, [2/3] bb
Length 3:	[3/0] aaa, [3/1] baa, [3/2] aab, [3/3] aba, [3/4] bba, [3/5] abb, [3/6] bab
Length 4:	[4/0] aaaa, [4/1] abaa, [4/2] baaa, [4/3] aaab, [4/4] aaba, [4/5] baab, [4/6] bbaa
Length 5:	[5/0] aaaaa, [5/1] baaaa, [5/2] aabaa, [5/3] aaaab, [5/4] aaaba, [5/5] abaaa, [5/6] abaab
Length 6:	[6/0] aaaaaa, [6/1] baaaaa, [6/2] aaabaa, [6/3] aaaaab, [6/4] aaaaba, [6/5] abaaaa, [6/6] aabaaa
Length 7:	[7/0] aaaaaaa, [7/1] baaaaaa, [7/2] aaaabaa, [7/3] aaaaaba, [7/4] abaaaaa, [7/5] aaaaaab, [7/6] aaabaaa

Considering [length 4 / frequency 1] abaa=c.

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

Rewriting system is complete. See ⟨a, b | abaaaab=baa⟩.