Morphocompletion for #4876 ⟨a, b | abbabbba=bab⟩

Solved by morph:2/1,3/1. (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: arenaTotalLimit

#	Rule
1.	abbabbba ⇒ bab
2.	babbbabbba ⇒ abbabbbbab
3.	ababbabbbbab ⇒ babbbba
4.	babbbbababbba ⇒ ababbabbbbbab
5.	abbabbbbabbbba ⇒ babbabbabbbbab
6.	ababababbabbbbbab ⇒ babbbbaabbba
7.	abbabbabbabbbbab ⇒ babbbbabbba
8.	ababbabbbbbabbbba ⇒ babbbbaabbabbbbab
9.	babbbbabbbababbba ⇒ abbabbabbabbbbbab
10.	abbabbababbabbbbbab ⇒ babbbbbababbba
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	bb	56	`lf:56,rf:47`
[2/1]	ab	50	`lf:39,lp:7,ls:4,rf:29,rp:3,rs:6,lprs:3`
[2/2]	ba	47	`lf:38,lp:3,ls:6,rf:30,rp:7,rs:4,lsrp:3`
[2/3]	aa	0	`rf:2,a:7`
[3/0]	bab	39	`lf:32,lp:3,ls:4,rf:24,rp:7,rs:6,re:1,lsrp:4,lprs:3`
[3/1]	bba	33	`lf:27,ls:6,rf:21,rs:4`
[3/2]	abb	31	`lf:27,lp:4,rf:21,rp:2`
[3/3]	bbb	29	`lf:29,rf:26`
[4/0]	babb	26	`lf:23,lp:3,rf:17,rp:6`
[4/1]	bbab	25	`lf:21,ls:4,rf:15,rs:5`
[4/2]	bbba	22	`lf:16,ls:6,rf:13,rs:4`
[4/3]	abbb	16	`lf:16,rf:13`
[5/0]	babbb	19	`lf:16,lp:3,rf:12,rp:5`
[5/1]	abbab	15	`lf:11,lp:4,rf:8,rp:2`
[5/2]	bbbab	14	`lf:10,ls:4,rf:7,rs:5,a:1`
[5/3]	bbabb	14	`lf:14,rf:9`
[6/0]	abbabb	14	`lf:10,lp:4,rf:8,rp:2`
[6/1]	bbbbab	12	`lf:8,ls:4,rf:7,rs:5,a:1`
[6/2]	babbbb	12	`lf:10,lp:2,rf:10,rp:5,a:1`
[6/3]	bbabbb	11	`lf:11,rf:6`

Considering [length 2 / frequency 1] ab=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	cbcbba ⇒ bc
3.	cbcbbc ⇒ bcb
4.	acbcbbbc ⇒ ccbbcbba
5.	ccbcbbbc ⇒ bcbbba
6.	bcbbcbba ⇒ cbcbbbc
7.	accbcbbbbc ⇒ ccbbbccbba
8.	accccbcbbbbc ⇒ ccbbbacbba
9.	bcbbcbbc ⇒ cbcbbbcb
10.	bcbbbacbba ⇒ ccccbcbbbbc
11.	ccbbcbbacbba ⇒ acccbcbbbbc
12.	bcbbbccbba ⇒ ccbcbbbbc
13.	ccbbcbbccbba ⇒ acbcbbbbc
14.	cbcbcbcbbbc ⇒ bcbbbcbba
15.	bcbbbacbbc ⇒ ccccbcbbbbcb
16.	ccbbcbbacbbc ⇒ acccbcbbbbcb
17.	bcbbbccbbc ⇒ ccbcbbbbcb
18.	ccbbcbbccbbc ⇒ acbcbbbbcb
19.	cbcbbbcbbba ⇒ bcbcbcbbbc
20.	cbcbbbcbbbc ⇒ bcbcbcbbbcb
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	bc	59	`lf:41,lp:6,ls:12,rf:35,rp:6,rs:7,re:1,lsrp:4,lprs:3,a:2`
[2/1]	cb	51	`lf:46,lp:5,rf:42,rp:2,rs:7,lprs:2,a:2`
[2/2]	bb	50	`lf:50,rf:45,a:2`
[2/3]	ba	18	`lf:11,ls:7,rf:6,rs:5,a:2`
[2/4]	cc	18	`lf:13,lp:5,rf:16,rp:7,a:6`
[2/5]	ac	10	`lf:7,lp:3,rf:5,rp:4,a:6`
[3/0]	bbc	36	`lf:24,ls:12,rf:15,rs:6,a:3`
[3/1]	cbb	35	`lf:35,rf:21,a:2`
[3/2]	bcb	31	`lf:25,lp:6,rf:27,rp:5,rs:7,re:1,lprs:3,a:2`
[3/3]	bba	18	`lf:11,ls:7,rf:6,rs:5,a:2`
[3/4]	cbc	16	`lf:11,lp:5,rf:14,rp:2,a:2`
[3/5]	ccb	16	`lf:11,lp:5,rf:10,rp:5,a:6`
[3/6]	bbb	15	`lf:15,rf:24,a:4`
[4/0]	bcbb	29	`lf:23,lp:6,rf:16,rp:2,a:2`
[4/1]	cbbc	20	`lf:14,ls:6,rf:1,a:3`
[4/2]	bbbc	16	`lf:10,ls:6,rf:14,rs:6,a:4`
[4/3]	cbcb	16	`lf:11,lp:5,rf:14,rp:2,a:2`
[4/4]	cbba	14	`lf:8,ls:6,rf:4,rs:4,a:2`
[4/5]	cbbb	13	`lf:13,rf:16,a:4`
[4/6]	ccbb	12	`lf:8,lp:4,rf:4,rp:3,a:6`
[5/0]	bcbbb	17	`lf:13,lp:4,rf:14,rp:2,a:4`
[5/1]	cbcbb	13	`lf:9,lp:4,rf:12,rp:2,a:2`
[5/2]	cbbbc	12	`lf:8,ls:4,rf:6,rs:2,a:4`
[5/3]	ccbbc	12	`lf:6,lp:4,ls:2,rf:1,rp:1,a:6`
[5/4]	bcbbc	10	`lf:6,lp:2,ls:2,a:3`
[5/5]	bbcbb	8	`lf:8,rf:2,a:4`
[5/6]	bcbba	6	`lf:4,ls:2,rf:2,rs:2,a:2`

Considering [length 3 / frequency 1] cbb=d.

Step 3

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

Rewriting system is complete. See ⟨a, b | abbabbba=bab⟩.