Morphocompletion for #5707 ⟨a, b, c | aa=b, acb=ca⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Right-to-left recursive path with deg(b) = 0; deg(a) = deg(c) = 1, a < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ ba
2.	bcbb ⇒ cb
3.	aa ⇒ b
4.	bcba ⇒ ca
5.	acb ⇒ ca
6.	bcbcb ⇒ ccb
7.	ccbb ⇒ bccb
8.	aca ⇒ bcb
9.	bcbca ⇒ cca
10.	ccba ⇒ bcca
11.	accb ⇒ bcca
12.	bcbccb ⇒ cccb
13.	ccbcb ⇒ bcccb
14.	acca ⇒ ccb
15.	bcbcca ⇒ ccca
16.	ccbca ⇒ bccca
17.	acccb ⇒ ccca
18.	bcbcccb ⇒ ccccb
19.	accca ⇒ bcccb
20.	acccca ⇒ ccccb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cb	25	`lf:18,ls:7,rf:10,rp:1,rs:10,re:1,lsrs:4,a:1`
[2/1]	cc	21	`lf:17,lp:4,rf:24,rp:8,a:5`
[2/2]	bc	21	`lf:14,lp:7,rf:7,rp:7,a:3`
[2/3]	ac	14	`lf:7,lp:7,a:1`
[2/4]	ca	14	`lf:7,ls:7,rf:8,rp:2,rs:8,re:2,lsrs:3,a:1`
[2/5]	ba	4	`lf:2,ls:2,rf:1,rp:1,rs:1,re:1,a:2`
[2/6]	bb	4	`lf:2,ls:2,a:6`
[3/0]	bcb	18	`lf:9,lp:7,ls:2,rf:1,rp:1,rs:1,re:1,a:3`
[3/1]	ccb	16	`lf:8,lp:4,ls:4,rf:8,rp:2,rs:8,re:2,lprs:11,lsrs:2,a:5`
[3/2]	acc	10	`lf:5,lp:5,a:5`
[3/3]	cca	8	`lf:4,ls:4,rf:6,rp:1,rs:6,re:1,lsrs:1,a:5`
[3/4]	cbc	7	`lf:7,a:7`
[3/5]	ccc	5	`lf:5,rf:10,rp:5,a:10`
[3/6]	cba	4	`lf:2,ls:2,a:4`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aa=b, acb=ca⟩.