Morphocompletion for #2623 ⟨a, b | abbaab=baba⟩

Solved by morph:2/0,2/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.	abbaab ⇒ baba
2.	bababaab ⇒ abbababa
3.	abbaaabbababa ⇒ babaababaab
4.	abbaaababbababa ⇒ babaababaabab
5.	babaababaabbbaab ⇒ abbaaabbababbaba
6.	bababaaabbababa ⇒ abababbababaaab
7.	abbaaabababbababa ⇒ babaababaababab
8.	bababaaababbababa ⇒ abababbababaaabab
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ba	46	`lf:37,lp:4,ls:5,rf:36,rp:4,rs:3,lsrp:3,lprs:2`
[2/1]	ab	43	`lf:36,lp:4,ls:3,rf:37,rp:4,rs:5,lsrp:2,lprs:3`
[2/2]	aa	15	`lf:15,rf:12`
[2/3]	bb	11	`lf:11,rf:6`
[3/0]	aba	28	`lf:23,ls:5,rf:26,rp:2,rs:3,lsrp:2`
[3/1]	bab	26	`lf:22,lp:4,rf:24,rp:4,rs:3,lprs:1`
[3/2]	abb	14	`lf:10,lp:4,rf:6,rp:2`
[3/3]	aab	13	`lf:10,ls:3,rf:9,rs:2`
[4/0]	baba	28	`lf:19,lp:4,ls:5,rf:18,rp:4,rs:3,re:1,lsrp:3,lprs:2`
[4/1]	abba	13	`lf:9,lp:4,rf:6,rp:2`
[4/2]	abab	13	`lf:13,rf:15,rp:2,rs:3,a:1`
[4/3]	baab	8	`lf:5,ls:3,rf:6,rs:1`
[5/0]	ababa	15	`lf:10,ls:5,rf:9,rp:2,rs:1,lsrp:2,a:1`
[5/1]	babab	12	`lf:9,lp:3,rf:7,rs:1,a:1`
[5/2]	abbaa	8	`lf:4,lp:4,rf:1,rp:1`
[5/3]	babaa	6	`lf:5,lp:1,rf:8,rp:3,a:1`
[6/0]	bababa	16	`lf:8,lp:3,ls:5,rf:3,rs:1,lprs:1,a:1`
[6/1]	abbaaa	6	`lf:3,lp:3,rf:1,rp:1,a:2`
[6/2]	babaab	5	`lf:3,lp:1,ls:1,rf:6,rp:3,rs:1,a:1`
[6/3]	abbaba	5	`lf:5,rf:5,rp:1,rs:1,a:1`

Considering [length 2 / frequency 0] ba=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ba ⇒ c
2.	cbcab ⇒ bcc
3.	bcca ⇒ cbcac
4.	cccab ⇒ abccc
5.	cccacb ⇒ acbccc
6.	cccaccb ⇒ accbccc
7.	cccacccb ⇒ acccbccc
8.	cccaccccb ⇒ accccbccc
9.	cccacccccb ⇒ acccccbccc
10.	cbccca ⇒ bcccac
11.	bccccca ⇒ cbccccac
12.	cbcccccca ⇒ bccccccac
13.	abcab ⇒ cc
14.	abcac ⇒ cca
15.	abccca ⇒ cccac
16.	abccccac ⇒ ccccca
17.	abcccccca ⇒ ccccccac
18.	cbcacbcac ⇒ bcccca
19.	abcaabccc ⇒ ccaccab
20.	abcaacbccc ⇒ ccaccacb
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	cc	56	`lf:48,lp:6,ls:2,rf:53,rp:7,rs:8,re:1,lsrp:2,lprs:6,a:2`
[2/1]	ca	26	`lf:20,ls:6,rf:13,rs:3,a:2`
[2/2]	ab	21	`lf:11,lp:7,ls:3,rf:2,rp:1,rs:1,lsrp:1,lprs:1,a:2`
[2/3]	cb	20	`lf:11,lp:4,ls:5,rf:8,rp:2,rs:1,a:3`
[2/4]	bc	18	`lf:16,lp:2,rf:12,rp:4,a:2`
[2/5]	ac	13	`lf:10,ls:3,rf:14,rp:5,rs:6,a:4`
[2/6]	aa	2	`lf:2,a:10`
[3/0]	ccc	37	`lf:29,lp:6,ls:2,rf:29,rp:3,rs:6,lprs:6,a:5`
[3/1]	cca	19	`lf:13,ls:6,rf:12,rp:3,rs:3,re:1,a:4`
[3/2]	abc	15	`lf:8,lp:7,rf:1,rp:1,a:2`
[3/3]	cac	12	`lf:9,ls:3,rf:9,rs:6,a:4`
[3/4]	bcc	11	`lf:9,lp:2,rf:11,rp:4,rs:1,re:1,a:3`
[3/5]	cbc	10	`lf:6,lp:4,rf:7,rp:2,a:3`
[3/6]	ccb	8	`lf:4,ls:4,rf:4,a:17`
[4/0]	ccca	23	`lf:12,lp:6,ls:5,rf:7,rp:1,rs:2,lsrp:1,a:5`
[4/1]	cccc	12	`lf:12,rf:13,rp:2,a:9`
[4/2]	bccc	11	`lf:8,lp:1,ls:2,rf:10,rp:3,rs:6,a:5`
[4/3]	abca	8	`lf:4,lp:4,a:2`
[4/4]	ccac	7	`lf:6,ls:1,rf:8,rp:2,rs:5,a:7`
[4/5]	abcc	7	`lf:4,lp:3,rf:1,rp:1,a:5`
[4/6]	cccb	6	`lf:3,ls:3,rf:3,a:20`
[5/0]	cccac	12	`lf:6,lp:5,ls:1,rf:5,rp:1,rs:5,re:1,a:7`
[5/1]	abccc	8	`lf:4,lp:3,ls:1,rf:1,rp:1,rs:1,re:1,a:5`
[5/2]	cccca	7	`lf:4,ls:3,rf:5,rs:2,a:9`
[5/3]	ccccc	6	`lf:6,rf:6,rp:2,a:11`
[5/4]	cbccc	6	`lf:3,lp:2,ls:1,rf:6,rp:1,rs:5,a:8`
[5/5]	bcccc	5	`lf:4,lp:1,rf:3,rp:2,a:9`
[5/6]	abcaa	4	`lf:2,lp:2,a:10`

Considering [length 2 / frequency 2] ab=d.

Step 3

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

Rewriting system is complete. See ⟨a, b | abbaab=baba⟩.