Morphocompletion for #6256 ⟨a, b, c | aa=1, bbcbcb=1⟩

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.	aa ⇒ 1
2.	bbc ⇒ cbb
3.	bcbc ⇒ cbcb
4.	bccbc ⇒ cbccb
5.	cbcbbb ⇒ 1
6.	bcccbc ⇒ cbcccb
7.	bccbcb ⇒ cbccbb
8.	bccccbc ⇒ cbccccb
9.	bcccbcb ⇒ cbcccbb
10.	cbccbbbb ⇒ bc
11.	bccccbcb ⇒ cbccccbb
12.	cbcccbbbb ⇒ bcc
13.	bcccccbcb ⇒ cbcccccbb
14.	cbccccbbbb ⇒ bccc
15.	cbcccccbbbb ⇒ bcccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	35	`lf:22,lp:8,ls:5,rf:12,rp:4,rs:1,re:1,a:3`
[2/1]	cb	31	`lf:22,lp:5,ls:4,rf:17,rp:9,rs:4,lsrp:4,a:3`
[2/2]	cc	26	`lf:26,rf:22,rs:3,a:7`
[2/3]	bb	21	`lf:15,lp:1,ls:5,rf:5,rs:5,lprs:10,a:3`
[3/0]	cbc	22	`lf:13,lp:5,ls:4,rf:8,rp:8,lsrp:13,a:3`
[3/1]	bcc	18	`lf:11,lp:7,rf:10,rp:3,rs:1,re:1,a:7`
[3/2]	ccc	15	`lf:15,rf:12,rs:2,a:15`
[3/3]	bbb	14	`lf:9,ls:5,a:3`
[3/4]	bcb	11	`lf:6,lp:1,ls:4,rf:1,rs:1,lprs:10,a:3`
[3/5]	ccb	11	`lf:11,rf:7,rs:3,a:7`
[3/6]	cbb	5	`lf:5,rf:5,rp:1,rs:5,re:1,a:3`

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

Step 2

Auxiliary generators:
1. d = bc
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 | aa=1, bbcbcb=1⟩.