Morphocompletion for #4681 ⟨a, b | aabbaaab=aba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabbaaab ⇒ aba
2.	ababaaab ⇒ aabbaaba
3.	aabbaaaabbaaba ⇒ abaabaaab
4.	ababaaaabbaaba ⇒ aabbaabaabaaab
5.	abaabaaababbaaab ⇒ abaabaaabba
6.	abaabaaabbabaaab ⇒ abaabaaababbaaba
7.	abaaabaaababbaaab ⇒ abaaabaaabba
8.	aabbaabaaaababbaaab ⇒ aabbaabaaaabba
9.	abaaaabaaababbaaab ⇒ abaaaabaaabba
	...

Collecting factors up to length 7, frequency 3:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	ab ⇒ c
2.	ccaacb ⇒ acbacc
3.	acbaac ⇒ ca
4.	acbaca ⇒ ccaac
5.	acbaccaac ⇒ ccaca
6.	acbaccaca ⇒ ccaccaac
7.	ccaaccbaac ⇒ acbacca
8.	ccaaccbaca ⇒ acbacccaac
9.	acbaaacbacc ⇒ cacaacb
10.	acbaccaccaac ⇒ ccaccaca
11.	acbaccaccaca ⇒ ccaccaccaac
12.	cacaaccbaac ⇒ cacaacba
13.	cacaacbcaac ⇒ cacaaccbaca
14.	ccaaccbaccaac ⇒ acbacccaca
15.	acbaccaaacbacc ⇒ ccacacaacb
16.	caacaaccbaac ⇒ caacaacba
17.	caacaacbcaac ⇒ caacaaccbaca
18.	cacaaccbaccaac ⇒ cacaacbcaca
19.	ccacaaaccbaac ⇒ ccacaaacba
20.	caaacaaccbaac ⇒ caaacaacba
	...

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ac, [2/1] ca, [2/2] aa, [2/3] cc, [2/4] cb
Length 3:	[3/0] aac, [3/1] caa, [3/2] acb, [3/3] acc, [3/4] cca
Length 4:	[4/0] caac, [4/1] acba, [4/2] ccaa, [4/3] baac, [4/4] caca
Length 5:	[5/0] ccaac, [5/1] acbac, [5/2] cbaac, [5/3] cbacc, [5/4] accba

Considering [length 4 / frequency 4] caca=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ca, [2/1] ac, [2/2] db, [2/3] cc, [2/4] ba
Length 3:	[3/0] cad, [3/1] aca, [3/2] aac, [3/3] dba, [3/4] acb
Length 4:	[4/0] cadd, [4/1] acba, [4/2] caac, [4/3] baca, [4/4] baac
Length 5:	[5/0] ccaac, [5/1] cbaac, [5/2] acbac, [5/3] caddd, [5/4] acbaa

Considering [length 5 / frequency 4] acbaa=e.

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

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