Morphocompletion for #5855 ⟨a, b | abaaba=baaab⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: workTotalLimit

#	Rule
1.	abaaba ⇒ baaab
2.	ababaaab ⇒ baaababa
3.	abbaabaaab ⇒ baabaaababaaa
4.	abbaaabaab ⇒ baabaaababaa
5.	abaabbaaab ⇒ baaabbaaba
6.	abbbaabaaab ⇒ baabaaababaaaaabaaa
7.	abbbaaabaab ⇒ baabaaababaaaaabaa
8.	abbabaaabaab ⇒ baabaaababaaaaaba
9.	abbbbaabaaab ⇒ baabaaababaaaaabaaaaabaaa
10.	abbbbaaabaab ⇒ baabaaababaaaaabaaaaabaa
11.	abbbabaaabaab ⇒ baabaaababaaaaabaaaaaba
12.	abbbbbaabaaab ⇒ baabaaababaaaaabaaaaabaaaaabaaa
13.	abbbbbaaabaab ⇒ baabaaababaaaaabaaaaabaaaaabaa
14.	abbbbabaaabaab ⇒ baabaaababaaaaabaaaaabaaaaaba
15.	abbbbbabaaabaab ⇒ baabaaababaaaaabaaaaabaaaaabaaaaaba
16.	abbbbbbbaabaaabbaabaaaaa ⇒ bbaabaaabbaabaaaabbbbbaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ab	82	`lf:52,lp:16,ls:14,rf:67,rs:1,lprs:1`
[2/1]	aa	51	`lf:50,ls:1,rf:151,rs:9,lsrs:1`
[2/2]	ba	39	`lf:38,ls:1,rf:82,rp:15,rs:6,lsrp:1`
[2/3]	bb	38	`lf:38,rf:7,rp:1,a:2`
[3/0]	aab	45	`lf:31,ls:14,rf:54,rs:1`
[3/1]	baa	32	`lf:32,rf:63,rp:15,rs:5`
[3/2]	abb	28	`lf:15,lp:13,rf:3,a:2`
[3/3]	aba	27	`lf:23,lp:3,ls:1,rf:63,rs:6,lprs:2`
[4/0]	baab	24	`lf:16,ls:8,rf:15,rp:12,lsrp:8`
[4/1]	abaa	23	`lf:21,lp:2,rf:44,rs:4`
[4/2]	aaab	21	`lf:15,ls:6,rf:39,rs:1`
[4/3]	abbb	20	`lf:10,lp:10,rf:1,a:14`
[5/0]	baaab	21	`lf:15,ls:6,rf:16,rp:3,rs:1,re:1,lsrp:2`
[5/1]	abaab	20	`lf:10,lp:2,ls:8`
[5/2]	abbbb	14	`lf:7,lp:7,rf:1,a:23`
[5/3]	aabaa	14	`lf:14,rf:32,rs:3,a:3`
[6/0]	aabaab	16	`lf:8,ls:8,a:3`
[6/1]	abaaab	15	`lf:10,ls:5,rf:13,a:1`
[6/2]	abbbbb	8	`lf:4,lp:4,rf:1,a:32`
[6/3]	baaaba	8	`lf:8,rf:13,rp:1,a:1`

Considering [length 4 / frequency 0] baab=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	acaaaaca ⇒ caaac
2.	acaaaba ⇒ caaab
3.	baac ⇒ caab
4.	baaac ⇒ acaaab
5.	baaaaca ⇒ acaaaab
6.	baab ⇒ c
7.	baaab ⇒ aca
8.	accaaab ⇒ caaacaabaaaa
9.	acacaaab ⇒ caaacaabaaa
10.	acaacaaab ⇒ caaacaabaa
11.	acaaacaaab ⇒ caaacaaba
12.	caaabc ⇒ aacaaacaab
13.	caaabac ⇒ acaaacaab
14.	caaabb ⇒ aacaaac
15.	caaabab ⇒ acaaac
16.	bcaaac ⇒ caaacaaaaab
17.	bacaaac ⇒ caaacaaaab
18.	baaaaacaaac ⇒ caaacb
19.	bcaaab ⇒ caaacaaa
20.	bacaaab ⇒ caaacaa
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	aa	47	`lf:47,rf:60,rp:2,rs:5,a:1`
[2/1]	ac	32	`lf:20,lp:6,ls:6,rf:21,rp:5,rs:3,lsrp:2,lprs:1,a:2`
[2/2]	ca	26	`lf:20,lp:4,ls:2,rf:29,rp:12,rs:1,lsrp:1,a:2`
[2/3]	ab	23	`lf:14,ls:9,rf:12,rs:8,a:1`
[2/4]	ba	20	`lf:11,lp:8,ls:1,rf:4,rs:1,a:1`
[2/5]	bc	6	`lf:3,lp:2,ls:1,a:21`
[2/6]	bb	2	`lf:1,ls:1,a:18`
[3/0]	aaa	24	`lf:24,rf:27,rs:3,a:2`
[3/1]	aab	21	`lf:13,ls:8,rf:12,rs:8,a:1`
[3/2]	caa	21	`lf:17,lp:4,rf:28,rp:12,rs:1,a:3`
[3/3]	aca	20	`lf:13,lp:5,ls:2,rf:17,rp:5,rs:1,re:1,lsrp:1,a:2`
[3/4]	aac	15	`lf:10,ls:5,rf:16,rp:2,rs:3,a:3`
[3/5]	baa	12	`lf:6,lp:6,rf:3,rs:1,a:1`
[3/6]	bac	6	`lf:3,lp:2,ls:1,a:8`
[4/0]	caaa	20	`lf:16,lp:4,rf:20,rp:11,rs:1,a:4`
[4/1]	aaab	19	`lf:12,ls:7,rf:5,rs:5,a:2`
[4/2]	acaa	14	`lf:10,lp:4,rf:16,rp:4,rs:1,a:4`
[4/3]	aaac	12	`lf:8,ls:4,rf:14,rs:3,a:5`
[4/4]	baaa	8	`lf:4,lp:4,rf:2,rs:1,a:2`
[4/5]	aaca	7	`lf:5,ls:2,rf:12,rp:2,a:6`
[4/6]	baca	4	`lf:2,lp:2,a:8`
[5/0]	caaab	21	`lf:11,lp:4,ls:6,rf:2,rp:1,rs:2,re:1,a:4`
[5/1]	acaaa	12	`lf:9,lp:3,rf:9,rp:4,rs:1,a:4`
[5/2]	caaac	7	`lf:4,ls:3,rf:14,rp:10,rs:3,re:1,lsrp:3,a:7`
[5/3]	aaaca	6	`lf:4,ls:2,rf:10,a:6`
[5/4]	bacaa	4	`lf:2,lp:2,a:8`
[5/5]	bcaaa	4	`lf:2,lp:2,a:27`
[5/6]	aaaba	4	`lf:3,ls:1,a:4`

Considering [length 5 / frequency 0] caaab=d.

Step 3

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

Rewriting system is complete. See ⟨a, b | abaaba=baaab⟩.