Morphocompletion for #7504 ⟨a, b, c | ab=1, bbaa=cc⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4 / frequency 7:

[2/0]	ba	34	`lf:18,lp:9,ls:7,rf:5,rp:1,rs:2,lsrp:1,lprs:1,lsrs:1,a:1`
[2/1]	cb	32	`lf:30,lp:1,ls:1,rf:24,rp:6,rs:1,lsrp:1,a:2`
[2/2]	ac	27	`lf:26,lp:1,rf:21,rp:4,rs:6,a:2`
[2/3]	bb	21	`lf:12,lp:1,ls:8,rf:12,rp:2,rs:8,lsrs:8,a:1`
[2/4]	aa	17	`lf:11,lp:5,ls:1,rf:8,rp:5,rs:1,lprp:5,a:1`
[2/5]	bc	13	`lf:13,rf:13,a:14`
[2/6]	ca	10	`lf:10,rf:10,a:11`
[3/0]	cbb	20	`lf:11,lp:1,ls:8,rf:10,rp:2,rs:8,re:1,lsrp:1,lsrs:8,a:2`
[3/1]	acb	18	`lf:16,lp:1,ls:1,rf:5,rp:4,rs:1,lprs:1,a:3`
[3/2]	aac	15	`lf:10,lp:5,rf:7,rp:5,rs:2,re:1,lprp:5,lprs:1,a:2`
[3/3]	cbc	13	`lf:13,rf:13,rp:4,a:14`
[3/4]	bcb	13	`lf:13,rf:13,a:14`
[3/5]	baa	11	`lf:6,lp:4,ls:1,rf:3,rp:1,rs:1,a:1`
[3/6]	cac	10	`lf:10,rf:10,rs:4,a:11`

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

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

Rewriting system is complete. See ⟨a, b, c | ab=1, bbaa=cc⟩.