Morphocompletion for #5374 ⟨a, b | ababbba=baab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < b

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	ababbba ⇒ baab
2.	baabbabbba ⇒ ababbbbaab
3.	ababbababbbbaab ⇒ baababbabbba
4.	baababbabbbaabbba ⇒ ababbababbbbabaab
5.	baabbabbababbbbaab ⇒ ababbbbaababbabbba
6.	ababbababbababbbbabaab ⇒ baabababbabbbaabbba
7.	ababbababbbbaaababbbbaab ⇒ baababbabbbaaabbabbba
8.	baabababbabbbaabbbaabbba ⇒ ababbababbababbbbababaab
9.	baababbabbbaabbababbbbaab ⇒ ababbababbbbabaababbabbba
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ba	55	`lf:46,lp:5,ls:4,rf:45,rp:4,rs:5,lsrp:1,lprs:2`
[2/1]	ab	55	`lf:46,lp:4,ls:5,rf:45,rp:5,rs:4,lsrp:2,lprs:1`
[2/2]	bb	45	`lf:45,rf:39`
[2/3]	aa	16	`lf:16,rf:12`
[3/0]	bba	29	`lf:25,ls:4,rf:22,rs:5`
[3/1]	bab	27	`lf:27,rf:29`
[3/2]	abb	25	`lf:25,rf:22`
[3/3]	bbb	20	`lf:20,rf:17`
[4/0]	baab	24	`lf:14,lp:5,ls:5,rf:10,rp:4,rs:4,re:1,lsrp:3,lprs:3`
[4/1]	babb	19	`lf:19,rf:20`
[4/2]	abab	19	`lf:15,lp:4,rf:16,rp:5`
[4/3]	bbba	18	`lf:14,ls:4,rf:12,rs:5`
[5/0]	ababb	18	`lf:14,lp:4,rf:14,rp:5`
[5/1]	bbaab	12	`lf:8,ls:4,rf:3,rs:1,a:1`
[5/2]	abbba	12	`lf:8,ls:4,rf:7,rs:5`
[5/3]	babbb	11	`lf:11,rf:11`
[6/0]	bbbaab	12	`lf:8,ls:4,rf:3,rs:1,a:1`
[6/1]	ababba	10	`lf:7,lp:3,rf:9,rp:3,a:2`
[6/2]	babbab	8	`lf:8,rf:9,a:2`
[6/3]	ababbb	8	`lf:7,lp:1,rf:5,rp:2`

Considering [length 3 / frequency 0] bba=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	cbabc ⇒ bcab
2.	bba ⇒ c
3.	baab ⇒ ababc
4.	bababc ⇒ cab
5.	cbabbcac ⇒ bcacbcba
6.	ababcba ⇒ baac
7.	baacbcba ⇒ ababbcac
8.	cbabbcab ⇒ bcacbc
9.	ababbcab ⇒ baacbc
10.	baaababc ⇒ ababcaab
11.	baacbbcab ⇒ ababbcacbc
12.	bababbcac ⇒ cacbcba
13.	cbabbcbaac ⇒ bcacbcabcba
14.	ababcababc ⇒ baacab
15.	ababcabcba ⇒ babaac
16.	baacbcababc ⇒ ababbcacab
17.	baacbcabcba ⇒ ababbcbaac
18.	ababcabbcab ⇒ babaacbc
19.	ababbcacbcba ⇒ baacbbcac
20.	bababbcbaac ⇒ cacbcabcba
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ba	48	`lf:33,lp:9,ls:6,rf:19,rp:6,rs:4,lsrp:3,lprs:2,a:1`
[2/1]	ab	47	`lf:36,lp:6,ls:5,rf:21,rp:6,rs:5,lsrp:2,lprs:1,a:2`
[2/2]	bc	29	`lf:24,ls:5,rf:21,rp:4,rs:5,lsrp:1,a:2`
[2/3]	cb	20	`lf:16,lp:4,rf:14,a:4`
[2/4]	ac	13	`lf:9,ls:4,rf:16,rs:5,a:4`
[2/5]	ca	12	`lf:12,rf:16,rp:3,a:3`
[2/6]	bb	11	`lf:10,lp:1,rf:5,a:1`
[3/0]	bab	22	`lf:19,lp:3,rf:8,rp:2,a:2`
[3/1]	cba	20	`lf:11,lp:4,ls:5,rf:5,rs:4,lprs:2,a:4`
[3/2]	aba	18	`lf:12,lp:6,rf:8,rp:6,a:2`
[3/3]	abc	16	`lf:11,ls:5,rf:4,rs:1,a:2`
[3/4]	baa	14	`lf:8,lp:6,rf:7,rp:4,a:2`
[3/5]	cab	13	`lf:9,ls:4,rf:6,rp:1,rs:4,re:1,a:3`
[3/6]	bca	12	`lf:12,rf:11,rp:4,a:5`
[4/0]	abab	18	`lf:12,lp:6,rf:6,rp:6,a:2`
[4/1]	babc	14	`lf:9,ls:5,rf:2,rs:1,a:2`
[4/2]	bcab	13	`lf:9,ls:4,rf:3,rp:1,rs:1,re:1,a:6`
[4/3]	bcba	12	`lf:7,ls:5,rf:5,rs:4,a:4`
[4/4]	baac	12	`lf:6,lp:4,ls:2,rf:7,rp:4,rs:3,re:1,lprs:1,a:4`
[4/5]	cbab	8	`lf:4,lp:4,a:6`
[4/6]	abbc	8	`lf:8,rf:4,a:9`
[5/0]	ababc	16	`lf:8,lp:4,ls:4,rf:2,rp:2,rs:1,re:1,lsrp:1,a:2`
[5/1]	bbcab	8	`lf:4,ls:4,a:9`
[5/2]	baacb	8	`lf:4,lp:4,rf:3,rp:2,a:11`
[5/3]	babbc	7	`lf:7,rf:4,a:9`
[5/4]	babab	6	`lf:3,lp:3,a:3`
[5/5]	ababb	6	`lf:4,lp:2,rf:4,rp:4,a:11`
[5/6]	cbabb	6	`lf:3,lp:3,a:9`

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

Step 3

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

Rewriting system is complete. See ⟨a, b | ababbba=baab⟩.