Morphocompletion for #1114 ⟨a, b, c | aa=1, bcccb=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < b < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	aa ⇒ 1
2.	cbb ⇒ bbc
3.	cccb ⇒ bccc
4.	bbccc ⇒ 1
5.	bbcbccc ⇒ cb
6.	bbccbccc ⇒ ccb
7.	bbcbcbccc ⇒ cbcb
8.	bbcbccbccc ⇒ cbccb
9.	bbccbcbccc ⇒ ccbcb
10.	bbcbcbcbccc ⇒ cbcbcb
11.	bbccbccbccc ⇒ ccbccb
12.	bbcbcbccbccc ⇒ cbcbccb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	36	`lf:26,lp:1,ls:9,rf:8,rp:3,rs:1,lsrp:3,lprs:1,a:2`
[2/1]	bc	25	`lf:25,rf:10,rp:1,rs:1,a:2`
[2/2]	cb	20	`lf:18,lp:1,ls:1,rf:16,rp:5,rs:8,re:1,a:2`
[2/3]	bb	20	`lf:10,lp:9,ls:1,rf:1,rp:1,lsrp:10,a:3`
[3/0]	ccc	20	`lf:10,lp:1,ls:9,rf:1,rs:1,lprs:10,a:2`
[3/1]	bbc	18	`lf:9,lp:9,rf:1,rp:1,rs:1,re:1,a:3`
[3/2]	cbc	16	`lf:16,rf:8,rp:4,a:4`
[3/3]	bcc	15	`lf:15,rf:4,rp:1,a:2`
[3/4]	bcb	10	`lf:10,rf:5,rs:3,a:4`
[3/5]	ccb	8	`lf:7,ls:1,rf:6,rp:3,rs:4,re:1,a:2`

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

Step 2

Auxiliary generators:
1. d = ccc
Reduction order:
- Left-to-right shortlex with a < d < b < c

Rewriting system is complete. See ⟨a, b, c | aa=1, bcccb=1⟩.