Morphocompletion for #2595 ⟨a, b | ababab=abba⟩

Solved by morph:4/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: trailTotalLimit

#	Rule
1.	ababab ⇒ abba
2.	abbaab ⇒ ababba
3.	abbabaab ⇒ ababbaba
4.	abbababaab ⇒ ababbababa
5.	abbabbaaab ⇒ ababbabbaa
6.	abbababbaaab ⇒ ababbababbaa
7.	abbabbabaaab ⇒ ababbabbabaa
8.	abbababbabaaab ⇒ ababbababbabaa
9.	abbabbababaaab ⇒ ababbabbababaa
10.	abbabbabbaaaab ⇒ ababbabbabbaaa
11.	ababbabbabbaaaab ⇒ abbababbabbaaa
12.	abbababbababaaab ⇒ ababbababbababaa
13.	abbababbabbaaaab ⇒ ababbababbabbaaa
14.	abbabbababbaaaab ⇒ ababbabbababbaaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ab	86	`lf:58,lp:14,ls:14,rf:55,rp:14,lprp:14,lsrp:14`
[2/1]	ba	44	`lf:44,rf:55,rs:4`
[2/2]	aa	27	`lf:27,rf:14,rs:10,a:1`
[2/3]	bb	27	`lf:27,rf:28`
[3/0]	abb	39	`lf:27,lp:12,rf:28,rp:2`
[3/1]	bab	32	`lf:31,ls:1,rf:41`
[3/2]	bba	27	`lf:27,rf:28,rs:2`
[3/3]	aab	26	`lf:13,ls:13,a:1`
[4/0]	abba	39	`lf:27,lp:12,rf:28,rp:2,rs:2,re:1,lprs:1`
[4/1]	aaab	20	`lf:10,ls:10,a:5`
[4/2]	bbab	20	`lf:20,rf:20,a:2`
[4/3]	baba	15	`lf:15,rf:15,rs:2`
[5/0]	abbab	31	`lf:20,lp:11,rf:20,rp:1,a:2`
[5/1]	babba	15	`lf:15,rf:26,rs:1,a:1`
[5/2]	baaab	12	`lf:6,ls:6,a:5`
[5/3]	bbaba	11	`lf:11,rf:12,rs:1,a:2`
[6/0]	abbaba	17	`lf:11,lp:6,rf:12,rp:1,rs:1,lprs:1,a:2`
[6/1]	abbabb	14	`lf:9,lp:5,rf:8,a:5`
[6/2]	bbabba	9	`lf:9,rf:8,a:5`
[6/3]	babbab	9	`lf:9,rf:19,a:2`

Considering [length 4 / frequency 0] abba=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	cccb ⇒ cbc
2.	cbccb ⇒ cbbc
3.	abccb ⇒ abbc
4.	cab ⇒ abc
5.	cbaccb ⇒ cbabc
6.	cbba ⇒ abbc
7.	cbca ⇒ cbacc
8.	ccba ⇒ cbac
9.	cbbca ⇒ abbccc
10.	cbcba ⇒ abbcc
11.	ababc ⇒ cba
12.	ababbc ⇒ cbacb
13.	abba ⇒ c
14.	abbca ⇒ ccc
15.	abcba ⇒ cc
16.	abbcba ⇒ cbabc
17.	abbcca ⇒ ccccc
18.	cbaab ⇒ cc
19.	cbaba ⇒ abcc
20.	ababab ⇒ c
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ab	28	`lf:16,lp:9,ls:3,rf:8,rp:6,lprp:1,lsrp:10`
[2/1]	cb	28	`lf:16,lp:8,ls:4,rf:9,rp:8,rs:1,lprp:3,lsrp:3,a:2`
[2/2]	ba	21	`lf:14,ls:7,rf:6,rs:1`
[2/3]	bc	13	`lf:11,ls:2,rf:10,rs:7,a:2`
[2/4]	ca	10	`lf:5,lp:1,ls:4,a:3`
[2/5]	cc	9	`lf:7,lp:2,rf:13,rp:4,rs:8,re:2,a:6`
[2/6]	bb	7	`lf:7,rf:5,a:1`
[3/0]	cba	14	`lf:7,lp:3,ls:4,rf:6,rp:6,rs:1,re:1,lprp:1,lsrp:11,a:4`
[3/1]	ccb	10	`lf:5,lp:1,ls:4,a:8`
[3/2]	aba	9	`lf:5,lp:3,ls:1`
[3/3]	abb	9	`lf:5,lp:4,rf:4,rp:4,a:1`
[3/4]	bca	6	`lf:3,ls:3,a:20`
[3/5]	bab	6	`lf:5,ls:1,rf:2`
[3/6]	abc	6	`lf:3,lp:2,ls:1,rf:4,rp:2,rs:3,re:1,a:3`
[4/0]	abab	8	`lf:4,lp:3,ls:1`
[4/1]	abbc	8	`lf:4,lp:3,ls:1,rf:4,rp:4,rs:2,re:2,a:2`
[4/2]	bcba	6	`lf:3,ls:3,a:7`
[4/3]	bbca	4	`lf:2,ls:2,a:24`
[4/4]	bccb	4	`lf:2,ls:2,a:21`
[4/5]	baba	3	`lf:2,ls:1`
[4/6]	cbaa	2	`lf:1,lp:1,a:6`
[5/0]	ababa	2	`lf:1,lp:1`
[5/1]	babab	2	`lf:1,ls:1`
[5/2]	ababb	2	`lf:1,lp:1,a:23`
[5/3]	bbcca	2	`lf:1,ls:1,a:28`
[5/4]	bbcba	2	`lf:1,ls:1,a:11`
[5/5]	cbacc	2	`lf:1,lp:1,rf:1,rp:1,rs:1,re:1,a:19`
[5/6]	baccb	2	`lf:1,ls:1,a:19`

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

Step 3

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

Rewriting system is complete. See ⟨a, b | ababab=abba⟩.