Morphocompletion for #2317 ⟨a, b | abaabba=baa⟩

Solved by morph:5/1,3/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: rulesLimit

#	Rule
1.	abaabba ⇒ baa
2.	abaabbbaa ⇒ babaa
3.	abaabbbbaa ⇒ babbaa
4.	abaabbbabaa ⇒ bababaa
5.	abaabbbbbaa ⇒ babbbaa
6.	abaabbbbabaa ⇒ babbabaa
7.	abaabbbabbaa ⇒ bababbaa
8.	abaabbbababaa ⇒ babababaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ab	29	`lf:21,lp:8,rf:12`
[2/1]	ba	22	`lf:21,ls:1,rf:20,rp:8,lsrp:1`
[2/2]	aa	22	`lf:15,ls:7,rf:8,rs:8,lsrs:7`
[2/3]	bb	20	`lf:20,rf:5`
[3/0]	baa	22	`lf:15,ls:7,rf:8,rp:1,rs:8,re:1,lsrs:7`
[3/1]	aba	20	`lf:12,lp:8,rf:8`
[3/2]	bbb	11	`lf:11,rf:1,a:1`
[3/3]	bba	10	`lf:9,ls:1,rf:4`
[4/0]	abaa	22	`lf:11,lp:8,ls:3,rf:4,rs:4,lprs:4,lsrs:3`
[4/1]	aabb	8	`lf:8`
[4/2]	baab	8	`lf:8`
[4/3]	bbaa	8	`lf:4,ls:4,rf:3,rs:3,lsrs:3,a:1`
[5/0]	abaab	16	`lf:8,lp:8`
[5/1]	baabb	8	`lf:8`
[5/2]	aabbb	7	`lf:7,a:1`
[5/3]	bbbaa	6	`lf:3,ls:3,rf:1,rs:1,lsrs:1,a:1`
[6/0]	abaabb	16	`lf:8,lp:8`
[6/1]	baabbb	7	`lf:7,a:1`
[6/2]	bbbbaa	4	`lf:2,ls:2,a:5`
[6/3]	aabbba	4	`lf:4,a:1`

Considering [length 5 / frequency 1] baabb=c.

Step 2

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = baabb
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.	baa ⇒ aca
2.	bac ⇒ acc
3.	acaacca ⇒ caa
4.	acabcaa ⇒ caaacca
5.	caabb ⇒ acabc
6.	acabb ⇒ c
7.	babc ⇒ acbc
8.	accaacca ⇒ bcaa
9.	acaaccc ⇒ cac
10.	accabb ⇒ bc
11.	acabcac ⇒ caaaccc
12.	babbc ⇒ acbbc
13.	acccaacca ⇒ bbcaa
14.	accaaccc ⇒ bcac
15.	acaaccbc ⇒ cabc
16.	acccabb ⇒ bbc
17.	babbbc ⇒ acbbbc
18.	acccaaccc ⇒ bbcac
19.	accaaccbc ⇒ bcabc
20.	accccabb ⇒ bbbc
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ac	40	`lf:24,lp:14,ls:2,rf:11,rp:6,rs:3,lsrp:10,lprs:3,a:2`
[2/1]	cc	27	`lf:24,ls:3,rf:4,rs:2,a:4`
[2/2]	ca	24	`lf:20,lp:1,ls:3,rf:13,rp:5,rs:2,lsrp:1,a:2`
[2/3]	bb	13	`lf:8,ls:5,rf:8,rp:4,lsrp:2,a:3`
[2/4]	aa	13	`lf:11,ls:2,rf:7,rs:3,a:2`
[2/5]	bc	12	`lf:7,ls:5,rf:14,rp:4,rs:9,re:1,lsrp:1,lsrs:5,a:7`
[2/6]	ab	10	`lf:10,rf:3,a:3`
[3/0]	acc	24	`lf:16,lp:8,rf:3,rp:1,rs:1,re:1,a:4`
[3/1]	cca	14	`lf:11,ls:3,rf:1,rs:1,a:5`
[3/2]	abb	12	`lf:7,ls:5,a:3`
[3/3]	aca	12	`lf:6,lp:6,rf:2,rp:2,rs:1,re:1,a:2`
[3/4]	caa	12	`lf:10,lp:1,ls:1,rf:5,rp:3,rs:3,re:1,lsrp:1,a:5`
[3/5]	ccc	11	`lf:8,ls:3,rf:1,rs:1,a:6`
[3/6]	aac	8	`lf:8,rf:2,a:5`
[4/0]	accc	14	`lf:7,lp:4,ls:3,rf:1,rs:1,a:6`
[4/1]	acca	14	`lf:7,lp:4,ls:3,rf:1,rs:1,a:5`
[4/2]	cabb	8	`lf:4,ls:4,a:3`
[4/3]	aacc	8	`lf:8,rf:2,a:5`
[4/4]	caac	8	`lf:8,a:5`
[4/5]	acab	6	`lf:3,lp:3,rf:1,rp:1,a:3`
[4/6]	acaa	6	`lf:3,lp:3,a:5`
[5/0]	caacc	8	`lf:8,a:5`
[5/1]	ccabb	6	`lf:3,ls:3,a:7`
[5/2]	aaccc	6	`lf:3,ls:3,rf:1,rs:1,a:6`
[5/3]	accca	6	`lf:3,lp:3,a:9`
[5/4]	aacca	6	`lf:3,ls:3,rf:1,rs:1,a:5`
[5/5]	acaac	6	`lf:3,lp:3,a:5`
[5/6]	accaa	6	`lf:3,lp:3,a:10`

Considering [length 3 / frequency 0] acc=d.

Step 3

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

Rewriting system is complete. See ⟨a, b | abaabba=baa⟩.