Morphocompletion for #500 ⟨a, b, c | bb=ac, bca=1⟩

Solved by morph:2/2. (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.	bbaa ⇒ abab
2.	bbab ⇒ a
3.	caa ⇒ bab
4.	cab ⇒ 1
5.	ac ⇒ bb
6.	bca ⇒ 1
7.	bcba ⇒ cbab
8.	bcbb ⇒ c
9.	abc ⇒ 1
10.	abbc ⇒ cbba
11.	abbbc ⇒ cbbbbbba
12.	cca ⇒ bcb
13.	ccbba ⇒ bc
14.	ccbbbba ⇒ bbcb
15.	ccbbbbbba ⇒ bbc
16.	ccbbbbbbbba ⇒ bbbcb
17.	bcc ⇒ ccbbbb
18.	bcbc ⇒ ccbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	25	`lf:22,lp:2,ls:1,rf:15,rp:4,rs:3,re:1`
[2/1]	bc	18	`lf:9,lp:5,ls:4,rf:5,rp:2,rs:2,re:1,a:1`
[2/2]	cc	12	`lf:6,lp:5,ls:1,rf:2,rp:2,lsrp:1,a:3`
[2/3]	ba	12	`lf:7,ls:5,rf:5,rp:1,rs:2,a:8`
[2/4]	ab	10	`lf:5,lp:3,ls:2,rf:4,rp:1,rs:3,a:6`
[2/5]	ca	8	`lf:4,lp:2,ls:2,a:1`
[2/6]	cb	7	`lf:7,rf:8,rp:3,rs:3,a:2`
[3/0]	bbb	13	`lf:13,rf:7,rp:1,rs:1,a:21`
[3/1]	bba	12	`lf:6,lp:2,ls:4,rf:2,rs:2,a:8`
[3/2]	ccb	8	`lf:4,lp:4,rf:2,rp:2,a:4`
[3/3]	bcb	6	`lf:3,lp:3,rf:3,rp:1,rs:3,re:1,a:2`
[3/4]	cbb	6	`lf:5,ls:1,rf:4,rp:2,rs:1,a:2`
[3/5]	bbc	4	`lf:2,ls:2,rf:3,rp:2,rs:1,re:1,a:8`
[3/6]	abb	4	`lf:2,lp:2,a:8`

Considering [length 2 / frequency 2] cc=d.

Step 2

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

Rewriting system is complete. See ⟨a, b, c | bb=ac, bca=1⟩.