Morphocompletion for #5383 ⟨a, b | abbaaab=aaba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbaaab ⇒ aaba
2.	abbaaaaba ⇒ aababaaab
3.	aababaaabbbaaab ⇒ aababaaababa
4.	aabaabaaabbbaaab ⇒ aabaabaaababa
5.	aabaaabaaabbbaaab ⇒ aabaaabaaababa
6.	aababaaabbbaaaaba ⇒ aababaaabababaaab
7.	aabaaaabaaabbbaaab ⇒ aabaaaabaaababa
8.	aabaaaaabaaabbbaaab ⇒ aabaaaaabaaababa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	aa	52	`lf:46,lp:6,rf:34,rp:8,lprp:6`
[2/1]	ab	36	`lf:28,lp:2,ls:6,rf:30,rs:2,lprs:1`
[2/2]	ba	24	`lf:22,ls:2,rf:28,rs:6`
[2/3]	bb	14	`lf:14`
[3/0]	aab	36	`lf:24,lp:6,ls:6,rf:20,rp:8,rs:2,lprp:6,lsrp:6,lprs:1`
[3/1]	aaa	22	`lf:22,rf:14`
[3/2]	baa	18	`lf:18,rf:12`
[3/3]	aba	16	`lf:14,ls:2,rf:28,rs:6`
[4/0]	aaab	23	`lf:17,ls:6,rf:11,rs:2`
[4/1]	aaba	20	`lf:12,lp:6,ls:2,rf:18,rp:8,rs:1,re:1,lprp:6,lsrp:2`
[4/2]	baaa	17	`lf:17,rf:11`
[4/3]	abaa	10	`lf:10,rf:12,a:1`
[5/0]	baaab	19	`lf:13,ls:6,rf:9,rs:2`
[5/1]	aabaa	12	`lf:8,lp:4,rf:8,rp:4,lprp:4,a:4`
[5/2]	abaaa	9	`lf:9,rf:11,a:1`
[5/3]	bbaaa	8	`lf:8`
[6/0]	bbaaab	12	`lf:6,ls:6`
[6/1]	aabaaa	10	`lf:7,lp:3,rf:7,rp:3,lprp:3,a:4`
[6/2]	abaaab	7	`lf:7,rf:9,rs:2,a:1`
[6/3]	aaaaba	6	`lf:4,ls:2,rf:2,a:1`

Considering [length 3 / frequency 0] aab=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aab ⇒ c
2.	aca ⇒ cbac
3.	abbac ⇒ ca
4.	cbcbacb ⇒ acc
5.	abbcbac ⇒ caa
6.	cbacbbac ⇒ acca
7.	accbac ⇒ cbacca
8.	abbcbcbac ⇒ caaa
9.	abbaacc ⇒ cabcbacb
10.	ccacbbac ⇒ cccbacba
11.	cbacbbcbac ⇒ accaa
12.	cabacbbac ⇒ cabcbacba
13.	acccbacb ⇒ cbcbaacc
14.	accbcbac ⇒ cbaccaa
15.	abbcbcbcbac ⇒ caaaa
16.	abbcbaacc ⇒ cccbacb
17.	ccacbbcbac ⇒ cccbacbaa
18.	ccbaccaba ⇒ ccbaccbbac
19.	cbacbbcbcbac ⇒ accaaa
20.	accbcbcbac ⇒ cbaccaaa
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ac	47	`lf:29,lp:5,ls:13,rf:16,rp:4,rs:2,lsrp:3,lprs:1,a:2`
[2/1]	cb	38	`lf:32,lp:4,ls:2,rf:18,rp:5,rs:2,lsrp:1,a:3`
[2/2]	ba	24	`lf:23,ls:1,rf:15,rs:2,a:2`
[2/3]	cc	16	`lf:11,lp:3,ls:2,rf:16,rp:4,rs:2,lprp:3,lsrp:1,a:5`
[2/4]	ab	16	`lf:9,lp:6,ls:1,rf:2,a:1`
[2/5]	bc	15	`lf:15,rf:3,a:4`
[2/6]	bb	12	`lf:12,rf:1,a:2`
[3/0]	bac	33	`lf:20,ls:13,rf:11,rs:2,a:2`
[3/1]	cba	19	`lf:16,lp:3,rf:14,rp:4,rs:2,a:3`
[3/2]	bcb	15	`lf:15,rf:3,a:4`
[3/3]	acc	13	`lf:7,lp:4,ls:2,rf:9,rp:4,rs:2,re:1,lprs:1,a:5`
[3/4]	abb	12	`lf:6,lp:6,a:2`
[3/5]	acb	10	`lf:8,ls:2,rf:5,rs:2,a:5`
[3/6]	cbc	9	`lf:8,lp:1,rf:1,rp:1,a:5`
[4/0]	cbac	27	`lf:15,lp:3,ls:9,rf:10,rp:4,rs:1,re:1,lsrp:3,a:3`
[4/1]	bcba	10	`lf:10,rf:3,a:4`
[4/2]	cbcb	9	`lf:8,lp:1,rf:1,rp:1,a:5`
[4/3]	bbac	8	`lf:4,ls:4,rf:1,rs:1,a:2`
[4/4]	bacb	8	`lf:6,ls:2,rf:5,rs:2,a:5`
[4/5]	abbc	8	`lf:4,lp:4,a:4`
[4/6]	bbcb	7	`lf:7,a:4`
[5/0]	bcbac	17	`lf:9,ls:8,rf:2,a:4`
[5/1]	cbacb	10	`lf:5,lp:3,ls:2,rf:5,rs:2,a:5`
[5/2]	abbcb	8	`lf:4,lp:4,a:4`
[5/3]	cbcba	7	`lf:6,lp:1,rf:1,rp:1,a:5`
[5/4]	cbbac	6	`lf:3,ls:3,rf:1,rs:1,a:6`
[5/5]	ccbac	5	`lf:3,lp:1,ls:1,rf:4,rp:1,lprp:1,a:7`
[5/6]	bcbcb	5	`lf:5,a:11`

Considering [length 5 / frequency 2] abbcb=d.

Step 3

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

Rewriting system is complete. See ⟨a, b | abbaaab=aaba⟩.