Morphocompletion for #6095 ⟨a, b, c | ab=c, bcc=ca⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	bccb ⇒ cc
3.	ca ⇒ bcc
4.	acc ⇒ cccb
5.	bcccc ⇒ ccccb
6.	acbcc ⇒ cccba
7.	ccccba ⇒ bcccbcc
8.	ccccbba ⇒ bbcccbcc
9.	ccccbbba ⇒ bbbcccbcc
10.	ccccbbbba ⇒ bbbbcccbcc
11.	ccccbbbbba ⇒ bbbbbcccbcc
12.	acbcbcc ⇒ cccbaa
13.	ccccbcba ⇒ bcbcccbcc
14.	ccccbcbba ⇒ bcbbcccbcc
15.	ccccbcbbba ⇒ bcbbbcccbcc
16.	ccccbbcba ⇒ bbcbcccbcc
17.	ccccbbcbba ⇒ bbcbbcccbcc
18.	acbcbcbcc ⇒ cccbaaa
19.	acbcbcbcbcc ⇒ cccbaaaa
20.	acbbcccbcc ⇒ cccbcccbba
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	59	`lf:42,lp:10,ls:7,rf:49,rp:8,rs:12,re:1,lsrp:7,lprs:10,a:1`
[2/1]	cb	29	`lf:28,ls:1,rf:23,rs:2,a:2`
[2/2]	bc	21	`lf:19,lp:2,rf:27,rp:5,a:1`
[2/3]	ba	20	`lf:10,ls:10,rf:5,rs:2,a:5`
[2/4]	bb	17	`lf:17,rf:17,rp:6,a:8`
[2/5]	ac	12	`lf:6,lp:6,a:3`
[2/6]	aa	0	`rf:6,rs:3,a:7`
[3/0]	ccc	34	`lf:23,lp:10,ls:1,rf:19,rp:7,lsrp:1,a:3`
[3/1]	bcc	15	`lf:8,lp:2,ls:5,rf:22,rp:2,rs:11,re:1,a:1`
[3/2]	cbc	14	`lf:14,rf:13,a:5`
[3/3]	bba	14	`lf:7,ls:7,rf:1,rs:1,a:8`
[3/4]	ccb	13	`lf:12,ls:1,rf:18,rs:2,a:2`
[3/5]	bcb	11	`lf:11,rf:5,rp:3,a:7`
[3/6]	acb	10	`lf:5,lp:5,a:5`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | ab=c, bcc=ca⟩.