Morphocompletion for #2255 ⟨a, b | aabbaab=aba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabbaab ⇒ aba
2.	ababaab ⇒ aabbaba
3.	aabbaaabbaba ⇒ abaabaab
4.	ababaaabbaba ⇒ aabbabaabaab
5.	abaabaababbaab ⇒ abaabaabba
6.	abaabaabbabaab ⇒ abaabaababbaba
7.	abaaabaababbaab ⇒ abaaabaabba
8.	aabbabaaababbaab ⇒ aabbabaaabba
9.	abaaaabaababbaab ⇒ abaaaabaabba
10.	abababaaababbaab ⇒ abababaaabba
	...

Collecting factors up to length 3, frequency 2:

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

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 5, frequency 2:

Considering [length 4 / frequency 0] aabc=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 3, frequency 2:

Length 2:	[2/0] bd, [2/1] ac

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

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(e) = 0; deg(c) = deg(d) = 1, c < d; deg(a) = deg(b) = 2, a < b
Auxiliary generators:
1. ba=c
2. aabc=d
3. bd=e

Rewriting system is not complete: roundsLimit

Collecting factors up to length 3, frequency 2:

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

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 3, frequency 2:

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

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

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

Rewriting system is complete. See ⟨a, b | aabbaab=aba⟩.