Morphocompletion for #4815 ⟨a, b | ababaaab=baa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	ababaaab ⇒ baa
2.	baaabaaab ⇒ ababaabaa
3.	abaababaabaa ⇒ baaaaab
4.	baaaaabbabaaab ⇒ abaababaababaa
5.	baaaababaabaa ⇒ ababaabaaaaab
6.	baaaaabbabaabaa ⇒ abaabababaaaaab
7.	baaaaaaabbabaaabab ⇒ ababaaaabaabababaa
8.	baaaaabaaabbabaaab ⇒ ababaaaababaababaa
9.	baaaaabbaababaabaa ⇒ abaababaababaaaaab
10.	baaaaaaabbabaaabbaa ⇒ ababaaaabaabbaaaaab
11.	ababaaaabaababaababaa ⇒ baaaaaaabbabaaab
	...

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] baa, [3/1] aaa, [3/2] aba, [3/3] aab, [3/4] bab, [3/5] bba, [3/6] abb
Length 4:	[4/0] abaa, [4/1] baaa, [4/2] aaab, [4/3] aaaa, [4/4] aaba, [4/5] baba, [4/6] abab
Length 5:	[5/0] baaaa, [5/1] babaa, [5/2] baaab, [5/3] aabaa, [5/4] aaaaa, [5/5] ababa, [5/6] abaaa
Length 6:	[6/0] baaaaa, [6/1] abaaab, [6/2] ababaa, [6/3] baabaa, [6/4] abaaba, [6/5] aaabba, [6/6] aaaaab
Length 7:	[7/0] baaaaab, [7/1] abaabaa, [7/2] babaaab, [7/3] aababaa, [7/4] aaaabba, [7/5] aaaaabb, [7/6] babaaba

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

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

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