Morphocompletion for #5015 ⟨a, b | aaabaaa=abab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaababab ⇒ ababbaaa
2.	aaabaaa ⇒ abab
3.	aaabaabab ⇒ abababaaa
4.	ababaababab ⇒ ababbabbaaa
5.	ababaabaaa ⇒ ababbab
6.	ababaabaabab ⇒ ababbababaaa
7.	ababbabaababab ⇒ ababbabbabbaaa
8.	ababbabaabaaa ⇒ ababbabbab
9.	ababbabbabaabaaa ⇒ ababbabbabbab
10.	ababbaaaabaabaaa ⇒ ababbaaaabbab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] aa, [2/2] ba, [2/3] bb
Length 3:	[3/0] aba, [3/1] bab, [3/2] aaa, [3/3] baa, [3/4] aab, [3/5] abb, [3/6] bba
Length 4:	[4/0] abab, [4/1] abaa, [4/2] aaba, [4/3] baaa, [4/4] baab, [4/5] baba, [4/6] aaab
Length 5:	[5/0] abaaa, [5/1] abaab, [5/2] ababa, [5/3] baaba, [5/4] aabaa, [5/5] ababb, [5/6] aaaba
Length 6:	[6/0] aabaaa, [6/1] abaaba, [6/2] ababba, [6/3] ababaa, [6/4] ababab, [6/5] baabab, [6/6] babaab
Length 7:	[7/0] baabaaa, [7/1] aababab, [7/2] abaabab, [7/3] ababaab, [7/4] babaaba, [7/5] ababbab, [7/6] abaabaa

Considering [length 6 / frequency 0] aabaaa=c.

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

Rewriting system is complete. See ⟨a, b | aaabaaa=abab⟩.