Morphocompletion for #6251 ⟨a, b, c | aa=1, bbbccb=1⟩

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) = deg(b) = 0, a < b; deg(c) = 1

Rewriting system is not complete: roundsLimit

#	Rule
1.	aa ⇒ 1
2.	bbbbc ⇒ cbbbb
3.	ccbbbb ⇒ 1
4.	bcc ⇒ ccb
5.	ccbcbbbb ⇒ bc
6.	ccbbcbbbb ⇒ bbc
7.	ccbbbcbbbb ⇒ bbbc
8.	ccbcbcbbbb ⇒ bcbc
9.	ccbcbbcbbbb ⇒ bcbbc
10.	ccbcbbbcbbbb ⇒ bcbbbc
11.	ccbbcbcbbbb ⇒ bbcbc
12.	ccbbcbbcbbbb ⇒ bbcbbc
13.	ccbbcbbbcbbbb ⇒ bbcbbbc
14.	ccbbbcbcbbbb ⇒ bbbcbc
15.	ccbbbcbbcbbbb ⇒ bbbcbbc
16.	ccbcbcbcbbbb ⇒ bcbcbc
17.	ccbcbcbbcbbbb ⇒ bcbcbbc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	78	`lf:63,lp:1,ls:14,rf:21,rp:7,rs:1,lsrp:7,lprs:1,a:9`
[2/1]	cb	39	`lf:39,rf:14,rp:1,rs:1,a:8`
[2/2]	cc	30	`lf:15,lp:14,ls:1,rf:1,rp:1,lsrp:10,a:8`
[2/3]	bc	29	`lf:27,lp:1,ls:1,rf:25,rp:6,rs:13,re:1,a:8`
[3/0]	bbb	50	`lf:35,lp:1,ls:14,rf:7,rp:3,rs:1,lsrp:3,lprs:1,a:9`
[3/1]	ccb	28	`lf:14,lp:14,rf:1,rp:1,rs:1,re:1,a:8`
[3/2]	cbb	27	`lf:27,rf:7,rp:1,a:9`
[3/3]	bcb	25	`lf:25,rf:12,rp:5,a:10`
[3/4]	bbc	15	`lf:14,ls:1,rf:13,rp:4,rs:8,re:1,a:11`
[3/5]	cbc	12	`lf:12,rf:6,rs:4,a:10`

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(b) = 0, a < b; deg(d) = deg(c) = 1, d < c

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