Morphocompletion for #7609 ⟨a, b, c | ab=1, cbcc=bc⟩

Solved by morph:2/0. (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 ⇒ 1
2.	cbcc ⇒ bc
3.	acbbc ⇒ bcc
4.	bbcc ⇒ cbbc
5.	accbbc ⇒ bccc
6.	cbcbc ⇒ bbc
7.	acbbbc ⇒ bcbc
8.	bbcbc ⇒ cbbbc
9.	acccbbc ⇒ bcccc
10.	accbbbc ⇒ bccbc
11.	cbcbbc ⇒ bbbc
12.	acbbbbc ⇒ bcbbc
13.	bbcbbc ⇒ cbbbbc
14.	accccbbc ⇒ bccccc
15.	acccbbbc ⇒ bcccbc
16.	accbbbbc ⇒ bccbbc
17.	cbcbbbc ⇒ bbbbc
18.	acbbbbbc ⇒ bcbbbc
19.	bbcbbbc ⇒ cbbbbbc
20.	cbcbbbbc ⇒ bbbbbc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	43	`lf:26,ls:17,rf:25,rp:11,rs:15,re:1,lsrp:10,lsrs:13,a:1`
[2/1]	bb	37	`lf:33,lp:4,rf:24,rp:4,a:2`
[2/2]	cb	27	`lf:22,lp:5,rf:10,rp:4,a:1`
[2/3]	ac	20	`lf:10,lp:10,a:6`
[2/4]	cc	14	`lf:12,ls:2,rf:14,rs:4,a:1`
[3/0]	bbc	38	`lf:19,lp:4,ls:15,rf:11,rp:1,rs:11,re:1,lprs:13,lsrs:8,a:2`
[3/1]	cbb	15	`lf:15,rf:7,rp:4,a:3`
[3/2]	bbb	14	`lf:14,rf:13,rp:3,a:3`
[3/3]	cbc	14	`lf:7,lp:5,ls:2,rf:3,rs:3,a:1`
[3/4]	acc	12	`lf:6,lp:6,a:10`
[3/5]	acb	8	`lf:4,lp:4,a:6`
[3/6]	bcb	7	`lf:7,rf:3,rp:3,a:2`

Considering [length 2 / frequency 0] bc=d.

Step 2

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

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