Morphocompletion for #1410 ⟨a, b | aabaabbaba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabaabba ⇒ baaabaab
2.	aabbaba ⇒ babaaab
3.	babaaaba ⇒ aaabaabb
4.	bbabaa ⇒ abaabb
5.	abaaabaabb ⇒ 1
6.	babaaabaab ⇒ 1
7.	baabbaba ⇒ abaabbab
8.	abaaabaababaabb ⇒ babaa
9.	abaabbbbaba ⇒ bbbaaabaabb
10.	abaabbbaaabaabb ⇒ bbaba
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ba	35	`lf:27,lp:3,ls:5,rf:14,rp:3,rs:1,lsrp:2,a:3`
[2/1]	ab	32	`lf:27,lp:4,ls:1,rf:15,rp:2,rs:3,a:3`
[2/2]	aa	25	`lf:22,lp:2,ls:1,rf:14,rp:1,rs:1,a:3`
[2/3]	bb	16	`lf:12,lp:1,ls:3,rf:7,rp:2,rs:3,lsrp:1,lprs:1,a:3`
[3/0]	aba	26	`lf:18,lp:4,ls:4,rf:8,rp:2,rs:1,lsrp:1,lprs:1,a:3`
[3/1]	aab	19	`lf:16,lp:2,ls:1,rf:9,rs:2,lprs:2,a:3`
[3/2]	baa	17	`lf:15,lp:1,ls:1,rf:9,rp:1,rs:1,a:3`
[3/3]	abb	11	`lf:8,ls:3,rf:4,rs:3,a:3`
[4/0]	abaa	18	`lf:13,lp:4,ls:1,rf:7,rp:2,rs:1,lsrp:1,lprs:1,a:3`
[4/1]	baba	12	`lf:7,lp:2,ls:3,rf:3,rp:2,rs:1,lsrp:1,a:3`
[4/2]	aabb	12	`lf:8,lp:1,ls:3,rf:4,rs:3,a:3`
[4/3]	baab	11	`lf:9,lp:1,ls:1,rf:5,rs:1,a:3`
[5/0]	baabb	11	`lf:7,lp:1,ls:3,rf:4,rs:3,a:3`
[5/1]	abaab	11	`lf:8,lp:2,ls:1,rf:5,rp:2,rs:1,a:3`
[5/2]	bbaba	8	`lf:4,lp:1,ls:3,rf:1,rp:1,rs:1,re:1,a:3`
[5/3]	babaa	7	`lf:4,lp:2,ls:1,rf:2,rp:2,rs:1,re:1,a:10`
[6/0]	abaabb	11	`lf:6,lp:2,ls:3,rf:4,rp:2,rs:3,re:1,lprs:1,a:3`
[6/1]	aabaab	7	`lf:5,lp:1,ls:1,rf:3,rs:1,lprs:1,a:6`
[6/2]	baaaba	6	`lf:5,ls:1,rf:2,rp:1,a:6`
[6/3]	abaaab	6	`lf:4,lp:2,rf:1,rs:1,a:12`

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

Step 2

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = baabb
Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(b) = deg(c) = 1, b < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	aaacab ⇒ 1
2.	caba ⇒ acab
3.	baaac ⇒ aacab
4.	acac ⇒ bb
5.	aaacaac ⇒ babaa
6.	baabb ⇒ c
7.	aabbaba ⇒ babaaab
8.	babaaaba ⇒ aaac
9.	bbabaa ⇒ ac
10.	acaacab ⇒ bbaba
11.	baabc ⇒ caabb
12.	bbac ⇒ acbb
13.	baabac ⇒ cbabaa
14.	aacabbb ⇒ cac
15.	baaacbb ⇒ cac
16.	acabcac ⇒ cabbb
17.	bbababb ⇒ accac
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ba	26	`lf:17,lp:6,ls:3,rf:8,rp:2,rs:1,lsrp:1,a:1`
[2/1]	ac	23	`lf:14,lp:3,ls:6,rf:9,rp:4,rs:5,re:1,lsrp:1,a:6`
[2/2]	aa	23	`lf:18,lp:4,ls:1,rf:8,rp:2,rs:2,lprs:1,a:1`
[2/3]	ab	17	`lf:15,ls:2,rf:9,rs:3,a:1`
[2/4]	bb	16	`lf:9,lp:3,ls:4,rf:6,rp:2,rs:4,re:1,lprs:1,a:1`
[2/5]	ca	10	`lf:9,lp:1,rf:7,rp:4,a:4`
[2/6]	bc	3	`lf:2,ls:1,a:4`
[3/0]	baa	13	`lf:7,lp:5,ls:1,rf:3,rs:2,lprs:1,a:1`
[3/1]	aca	10	`lf:7,lp:3,rf:2,rp:1,a:6`
[3/2]	aac	10	`lf:7,lp:1,ls:2,rf:2,rp:1,rs:1,lsrp:1,a:7`
[3/3]	aba	10	`lf:7,ls:3,rf:4,rs:1,a:12`
[3/4]	cab	8	`lf:5,lp:1,ls:2,rf:3,rp:1,rs:2,lprs:10,a:7`
[3/5]	bba	7	`lf:4,lp:3,rf:1,rp:1,a:9`
[3/6]	aaa	7	`lf:5,lp:2,rf:2,rp:1,a:10`
[4/0]	acab	7	`lf:4,lp:1,ls:2,rf:2,rp:1,rs:2,re:1,a:7`
[4/1]	aaac	7	`lf:4,lp:2,ls:1,rf:1,rp:1,rs:1,re:1,a:10`
[4/2]	baba	6	`lf:4,lp:1,ls:1,rf:4,rp:2,rs:1,lsrp:1,a:15`
[4/3]	baab	6	`lf:3,lp:3,a:1`
[4/4]	bbab	5	`lf:3,lp:2,rf:1,rp:1,a:15`
[4/5]	aaca	5	`lf:4,lp:1,rf:1,rp:1,a:7`
[4/6]	baaa	5	`lf:3,lp:2,rf:1,a:10`
[5/0]	bbaba	6	`lf:3,lp:2,ls:1,rf:1,rp:1,rs:1,re:1,a:15`
[5/1]	aacab	6	`lf:3,lp:1,ls:2,rf:1,rp:1,rs:1,re:1,a:7`
[5/2]	acaac	4	`lf:2,lp:1,ls:1,a:15`
[5/3]	babaa	4	`lf:2,lp:1,ls:1,rf:3,rp:2,rs:2,re:1,a:29`
[5/4]	aaaca	4	`lf:2,lp:2,a:24`
[5/5]	cabbb	2	`lf:1,ls:1,rf:1,rp:1,rs:1,re:1,a:7`
[5/6]	abcac	2	`lf:1,ls:1,a:17`

Considering [length 4 / frequency 0] acab=d.

Step 3

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

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