Morphocompletion for #5733 ⟨a, b | aabbaa=abaab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabbaa ⇒ abaab
2.	abaabbbaa ⇒ aabbabaab
3.	abaababbaa ⇒ ababaabb
4.	abaababbabaab ⇒ ababaabbbbaa
5.	ababaabbabbaa ⇒ abaabbabaabb
6.	ababaabbbbaabaa ⇒ abaababbababaab
7.	ababaabbabbabaab ⇒ abaabbabaabbbbaa
8.	abaabbabaabbabbaa ⇒ ababaabbbabaabb
9.	abaabbabaabbbbaabaa ⇒ ababaabbabbababaab
10.	ababaabbbbaaaababbaa ⇒ ababaabbbbaaabaabb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] ba, [2/2] aa, [2/3] bb
Length 3:	[3/0] baa, [3/1] aba, [3/2] aab, [3/3] bba, [3/4] abb, [3/5] bab, [3/6] bbb
Length 4:	[4/0] abaa, [4/1] baab, [4/2] bbaa, [4/3] abba, [4/4] abab, [4/5] aabb, [4/6] baba
Length 5:	[5/0] abaab, [5/1] abbaa, [5/2] baabb, [5/3] babaa, [5/4] ababa, [5/5] abbab, [5/6] aabba
Length 6:	[6/0] abaabb, [6/1] babaab, [6/2] babbaa, [6/3] ababaa, [6/4] baabba, [6/5] aabbab, [6/6] bbabaa
Length 7:	[7/0] ababaab, [7/1] abaabba, [7/2] bbabaab, [7/3] babaabb, [7/4] baabbab, [7/5] abaabbb, [7/6] bbabbaa

Considering [length 2 / frequency 0] ab=c.

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

Rewriting system is complete. See ⟨a, b | aabbaa=abaab⟩.