Morphocompletion for #5811 ⟨a, b | abaaab=aaaba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaaab ⇒ aaaba
2.	aaabaaaab ⇒ abaaaaaba
3.	ababaaaaaba ⇒ aaabaaaaab
4.	aaabaabaaaaaba ⇒ abaaaaabaaaaab
5.	aaabaaaaabaab ⇒ ababaaaaaaaba
6.	abababaaaaaaaba ⇒ aaabaaaaaabaab
7.	aaabaaaaabbaaab ⇒ ababaaaaaaabaa
8.	aaabaaaaaabbaaab ⇒ aaabaaaaaabaaba
9.	aaabaaaaaabaabaab ⇒ abababaaaaaaaaaba
10.	aaabaaaaaaabbaaab ⇒ aaabaaaaaaabaaba
	...

Collecting factors up to length 3, frequency 2:

Length 2:	[2/0] aa, [2/1] ab

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aaca ⇒ caac
2.	aaccaac ⇒ ccaacca
3.	aacccaacc ⇒ ccccaacca
4.	ccaaccaa ⇒ aacccaac
5.	aacccccaacca ⇒ ccaaccccaacc
6.	ccaaccacaac ⇒ aaccccaacca
7.	ccaaccaccaacc ⇒ aaccccccaacca
8.	ccaaccccaaccac ⇒ aacccccccaacca
9.	aaaacccaac ⇒ ccaaccacaa
10.	ccaaccacaaa ⇒ aaaaccccaac
11.	aaaaccccaacca ⇒ ccaaccacacaac
12.	aaaaaaccccaac ⇒ ccaaccacacaaa
13.	ccaaccacacaaaa ⇒ aaaaaacccccaac
14.	ab ⇒ c
15.	caacb ⇒ aacc
16.	ccaaccb ⇒ aaaacc
17.	ccaaccacb ⇒ aaaaaacc
18.	ccaaccacacb ⇒ aaaaaaaacc
19.	ccaaccccaacccb ⇒ aacccaaaaaacc
20.	ccaaccacacacb ⇒ aaaaaaaaaacc
	...

Collecting factors up to length 5, frequency 2:

Considering [length 2 / frequency 0] cc=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 3, frequency 2:

Length 2:	[2/0] aa, [2/1] da

Considering [length 2 / frequency 0] aa=e.

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = ab
2. d = cc
3. e = aa
Reduction order:
- Left-to-right recursive path with deg(d) = 0; deg(e) = 1; deg(c) = 2; deg(a) = 3; deg(b) = 4

Rewriting system is not complete: roundsLimit

Collecting factors up to length 3, frequency 2:

Length 2:	[2/0] ec, [2/1] de

Considering [length 2 / frequency 0] ec=f.

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = ab
2. d = cc
3. e = aa
4. f = ec
Reduction order:
- Left-to-right recursive path with deg(d) = deg(f) = 0, d < f; deg(e) = 1; deg(c) = 2; deg(a) = 3; deg(b) = 4

Rewriting system is not complete: roundsLimit

Collecting factors up to length 3, frequency 2:

Length 2:	[2/0] fd, [2/1] de

Considering [length 2 / frequency 1] de=g.

Auxiliary generators:
1. c = ab
2. d = cc
3. e = aa
4. f = ec
5. g = de
Reduction order:
- Left-to-right recursive path with deg(d) = deg(f) = deg(g) = 0, d < f < g; deg(e) = 1; deg(c) = 2; deg(a) = 3; deg(b) = 4

Rewriting system is complete. See ⟨a, b | abaaab=aaaba⟩.