Morphocompletion for #4485 ⟨a, b | aaabaaab=aba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaaaab ⇒ aaababa
2.	aaabaaab ⇒ aba
3.	abaaaaaababa ⇒ aaababaaaaab
4.	aaabaaaaababa ⇒ abaaaaab
5.	abaaaaabbaaaab ⇒ abaaaaabaababa
6.	abaaaaaabbaaaab ⇒ abaaaaaabaababa
7.	abaaaaabaabaaab ⇒ abaaaaabba
8.	abaaaaaaabbaaaab ⇒ abaaaaaaabaababa
9.	abaaaaaabaabaaab ⇒ abaaaaaabba
10.	abaaaaaaabaabaaab ⇒ abaaaaaaabba
11.	abaaaaaaaabaabaaab ⇒ abaaaaaaaabba
	...

Collecting factors up to length 7, frequency 3:

Considering [length 2 / frequency 1] ab=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. ab=c

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	ab ⇒ c
2.	caaac ⇒ aacca
3.	aacaac ⇒ ca
4.	aacaaaaccc ⇒ caaaacb
5.	caaaaacca ⇒ aaccaaaac
6.	aacaaaacca ⇒ caaaac
7.	aaccaaaaaccc ⇒ cacaaaacb
8.	caaaacacaac ⇒ caaaacba
9.	aaccaaaacb ⇒ caaaaaccc
10.	aaccacaaaaaccc ⇒ cacacaaaacb
11.	caaaaacacaac ⇒ caaaaacba
12.	aaccacaaaacb ⇒ cacaaaaaccc
13.	caaaacbaaac ⇒ caaaacacca
14.	caaaaaacacaac ⇒ caaaaaacba
15.	aaccacacaaaacb ⇒ cacacaaaaaccc
16.	caaaaacbaaac ⇒ caaaaacacca
17.	caaaaaaacacaac ⇒ caaaaaaacba
18.	caaaacacaaaacca ⇒ caaaacbaaaac
19.	caaaaaacbaaac ⇒ caaaaaacacca
20.	caaaaaaaacacaac ⇒ caaaaaaaacba
	...

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] aa, [2/1] ac, [2/2] ca, [2/3] cc, [2/4] cb
Length 3:	[3/0] aaa, [3/1] aac, [3/2] caa, [3/3] aca, [3/4] cca
Length 4:	[4/0] aaaa, [4/1] caaa, [4/2] aaac, [4/3] aacc, [4/4] acaa
Length 5:	[5/0] caaaa, [5/1] aaaac, [5/2] aaaaa, [5/3] aacca, [5/4] acaac

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	dcddcdc ⇒ cd
2.	cdddcdc ⇒ dcddccd
3.	dcddcddcddccd ⇒ cddddcdc
4.	cddddcdccddcdc ⇒ dcddcddcddcccd
5.	cdddcddcddccd ⇒ dcddccddddcdc
6.	dcddcddcddcddcddcccd ⇒ cdddddcdccddcdc
7.	cddddcdccddcddcddccd ⇒ dcddcddcddcccddddcdc
8.	cdddcddcddcddcddcccd ⇒ dcddccdddddcdccddcdc
9.	ca ⇒ dcdc
10.	da ⇒ ad
11.	db ⇒ ac
12.	dcdcb ⇒ cc
13.	cddcb ⇒ dcddccc
14.	cdddcb ⇒ dcddcddcddccc
15.	cddddcb ⇒ dcddcddcddcddcddccc
16.	cdddddcb ⇒ dcddcddcddcddcddcddcddccc
17.	cddddcdccdcb ⇒ dcddcddcddcccc
18.	cdddddcdccdcb ⇒ dcddcddcddcddcddcccc
19.	aa ⇒ d
20.	ab ⇒ c
	...

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] cd, [2/1] dc, [2/2] dd, [2/3] cb, [2/4] cc
Length 3:	[3/0] cdd, [3/1] ddc, [3/2] dcd, [3/3] ddd, [3/4] dcb
Length 4:	[4/0] ddcd, [4/1] cddc, [4/2] cddd, [4/3] dcdd, [4/4] dcdc
Length 5:	[5/0] dcddc, [5/1] ddcdd, [5/2] cddcd, [5/3] cdddd, [5/4] ddcdc

Considering [length 3 / frequency 0] cdd=e.

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

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