Morphocompletion for #3046 ⟨a, b | aabaabbabba=1⟩

Solved by morph:6/0,5/0. (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: rulesLimit

#	Rule
1.	baabbabba ⇒ abaabbabb
2.	babbaaab ⇒ aabbabba
3.	bbabbaaa ⇒ abaabbab
4.	bbaaabaa ⇒ aabaabba
5.	aaabaabbabb ⇒ 1
6.	baaabaabba ⇒ aaabaabbab
7.	baabbababaabbabb ⇒ aabaabbabbbbabba
8.	baabbabaabaabbabb ⇒ aabaabbabbbbabbaa
9.	aaabaabbababaabbab ⇒ babbaaa
10.	aaabaabbabaabaabba ⇒ baaabaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ba	42	`lf:34,lp:5,ls:3,rf:22,rp:2,rs:3,lsrp:1,lprs:2,a:2`
[2/1]	ab	34	`lf:32,ls:2,rf:23,rp:2,rs:2,a:2`
[2/2]	aa	33	`lf:28,lp:3,ls:2,rf:18,rp:5,rs:3,lsrp:1,lprs:2,a:2`
[2/3]	bb	24	`lf:19,lp:2,ls:3,rf:18,rs:1,a:2`
[3/0]	baa	23	`lf:18,lp:4,ls:1,rf:10,rp:1,rs:2,lprs:1,a:2`
[3/1]	bba	21	`lf:16,lp:2,ls:3,rf:13,rs:3,lprs:1,a:2`
[3/2]	aab	20	`lf:19,ls:1,rf:12,rp:4,lsrp:1,a:2`
[3/3]	abb	20	`lf:17,ls:3,rf:14,rs:1,a:2`
[4/0]	abba	17	`lf:14,ls:3,rf:11,rs:3,a:2`
[4/1]	baab	16	`lf:13,lp:3,rf:6,a:2`
[4/2]	abaa	12	`lf:11,ls:1,rf:7,rp:2,rs:1,a:2`
[4/3]	bbab	12	`lf:10,lp:1,ls:1,rf:8,rs:2,lprs:1,a:2`
[5/0]	baabb	14	`lf:11,lp:3,rf:6,a:2`
[5/1]	aabba	13	`lf:11,ls:2,rf:7,rp:1,rs:1,a:2`
[5/2]	abaab	10	`lf:10,rf:6,rp:2,a:2`
[5/3]	abbab	10	`lf:9,ls:1,rf:6,rs:2,a:2`
[6/0]	baabba	16	`lf:11,lp:3,ls:2,rf:6,rs:1,a:2`
[6/1]	aabbab	10	`lf:9,ls:1,rf:6,rp:1,rs:2,a:2`
[6/2]	aaabaa	9	`lf:5,lp:3,ls:1,rf:2,rp:1,rs:1,lprs:1,a:26`
[6/3]	abaabb	8	`lf:8,rf:6,rp:2,a:2`

Considering [length 6 / frequency 0] baabba=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	cacbc ⇒ acbb
2.	ccacbc ⇒ cacbb
3.	bba ⇒ acbc
4.	acacbc ⇒ aacbb
5.	acbccacbc ⇒ acbcacbb
6.	cacbacbb ⇒ aacbbcbc
7.	baabc ⇒ caacbc
8.	baabb ⇒ caacbb
9.	bcaacbc ⇒ acbcabc
10.	bcaacbb ⇒ acbcabb
11.	aaacbb ⇒ 1
12.	aacbbcacbc ⇒ cbb
13.	baaacb ⇒ 1
14.	baaacbc ⇒ c
15.	aaacbacbc ⇒ ba
16.	baaacbacbb ⇒ acbb
17.	baaacbaacbb ⇒ aacbb
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	bc	24	`lf:13,lp:2,ls:9,rf:8,rs:4,lprs:1,lsrs:2,a:3`
[2/1]	ac	23	`lf:21,lp:2,rf:13,rp:6,lprp:1,a:3`
[2/2]	aa	21	`lf:18,lp:3,rf:5,rp:3,a:3`
[2/3]	cb	21	`lf:20,ls:1,rf:15,rp:1,a:3`
[2/4]	ba	18	`lf:11,lp:6,ls:1,rf:1,rp:1,rs:1,re:1,a:4`
[2/5]	bb	15	`lf:8,lp:1,ls:6,rf:10,rs:9,lsrs:4,a:3`
[2/6]	ca	10	`lf:8,lp:2,rf:6,rp:3,a:3`
[3/0]	acb	22	`lf:20,lp:1,ls:1,rf:13,rp:6,lprp:1,a:3`
[3/1]	cbc	17	`lf:9,ls:8,rf:6,rs:3,a:3`
[3/2]	baa	13	`lf:7,lp:6,a:4`
[3/3]	aac	11	`lf:10,lp:1,rf:5,rp:3,a:3`
[3/4]	cbb	11	`lf:6,ls:5,rf:9,rp:1,rs:8,re:1,lsrs:2,a:3`
[3/5]	aaa	8	`lf:6,lp:2,a:16`
[3/6]	cac	8	`lf:6,lp:2,rf:2,rp:1,a:3`
[4/0]	acbc	18	`lf:9,lp:1,ls:8,rf:5,rp:4,rs:2,re:1,lprp:1,lsrp:2,a:3`
[4/1]	aacb	12	`lf:10,lp:1,ls:1,rf:5,rp:3,a:3`
[4/2]	acbb	11	`lf:6,ls:5,rf:8,rp:2,rs:7,re:2,lsrp:1,lsrs:2,a:3`
[4/3]	baaa	8	`lf:4,lp:4,a:16`
[4/4]	aaac	8	`lf:6,lp:2,a:16`
[4/5]	cacb	8	`lf:6,lp:2,rf:2,rp:1,a:3`
[4/6]	bcaa	4	`lf:2,lp:2,a:15`
[5/0]	aaacb	9	`lf:6,lp:2,ls:1,a:16`
[5/1]	baaac	8	`lf:4,lp:4,a:16`
[5/2]	aacbb	8	`lf:4,lp:1,ls:3,rf:4,rp:3,rs:3,re:2,lsrp:1,lsrs:1,a:3`
[5/3]	cacbc	8	`lf:4,ls:4,a:3`
[5/4]	bcaac	4	`lf:2,lp:2,a:15`
[5/5]	aacbc	4	`lf:2,ls:2,rf:1,rs:1,a:4`
[5/6]	bacbb	4	`lf:2,ls:2,a:35`

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

Step 3

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

Rewriting system is complete. See ⟨a, b | aabaabbabba=1⟩.