Morphocompletion for #5521 ⟨a, b, c | ab=c, abba=c⟩

Solved by morph:2/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	cba ⇒ c
3.	cbc ⇒ cb
4.	cbba ⇒ cb
5.	cbbc ⇒ cbb
6.	cbbba ⇒ cbb
7.	cbbbc ⇒ cbbb
8.	cbbbba ⇒ cbbb
9.	cbbbbc ⇒ cbbbb
10.	cbbbbba ⇒ cbbbb
11.	cbbbbbc ⇒ cbbbbb
12.	cbbbbbba ⇒ cbbbbb
13.	cbbbbbbc ⇒ cbbbbbb
14.	cbbbbbbba ⇒ cbbbbbb
15.	cbbbbbbbc ⇒ cbbbbbbb
16.	cbbbbbbbba ⇒ cbbbbbbb
17.	cbbbbbbbbc ⇒ cbbbbbbbb
18.	cbbbbbbbbba ⇒ cbbbbbbbb
19.	cbbbbbbbbbc ⇒ cbbbbbbbbb
20.	cbbbbbbbbbba ⇒ cbbbbbbbbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	81	`lf:81,rf:72,rs:16,a:3`
[2/1]	cb	38	`lf:19,lp:19,rf:18,rp:18,rs:2,re:2,lprp:18,lprs:2,a:1`
[2/2]	ba	20	`lf:10,ls:10,a:1`
[2/3]	bc	18	`lf:9,ls:9,a:2`
[3/0]	bbb	64	`lf:64,rf:56,rs:14,a:5`
[3/1]	cbb	34	`lf:17,lp:17,rf:16,rp:16,rs:2,re:2,lprp:16,lprs:2,a:3`
[3/2]	bba	18	`lf:9,ls:9,a:3`
[3/3]	bbc	16	`lf:8,ls:8,a:4`

Considering [length 2 / frequency 1] cb=d.

Step 2

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

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