Morphocompletion for #1723 ⟨a, b, c | aab=ca, abc=1⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	abc ⇒ 1
2.	acbc ⇒ ab
3.	accbc ⇒ acb
4.	acccbc ⇒ accb
5.	accccbc ⇒ acccb
6.	acccccbc ⇒ accccb
7.	cab ⇒ 1
8.	cac ⇒ a
9.	aab ⇒ ca
10.	aacb ⇒ cca
11.	aaccb ⇒ ccca
12.	aacccb ⇒ cccca
13.	aaccccb ⇒ ccccca
14.	aba ⇒ ac
15.	acba ⇒ acc
16.	accba ⇒ accc
17.	acccba ⇒ acccc
18.	accccba ⇒ accccc
19.	caa ⇒ aac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	24	`lf:14,lp:9,ls:1,rf:10,rp:9,rs:2,re:1,lprp:8,a:2`
[2/1]	cc	22	`lf:22,rf:26,rp:4,rs:4,a:7`
[2/2]	cb	17	`lf:13,ls:4,rf:4,rs:4,a:6`
[2/3]	aa	12	`lf:6,lp:5,ls:1,rf:1,rp:1,lsrp:10`
[2/4]	bc	12	`lf:6,ls:6,a:1`
[2/5]	ba	10	`lf:5,ls:5,a:3`
[2/6]	ab	8	`lf:4,lp:2,ls:2,rf:1,rp:1,rs:1,re:1`
[3/0]	acc	17	`lf:10,lp:7,rf:7,rp:7,rs:1,re:1,lprp:6,a:7`
[3/1]	ccb	13	`lf:10,ls:3,rf:3,rs:3,a:10`
[3/2]	ccc	12	`lf:12,rf:15,rp:3,rs:3,a:12`
[3/3]	cbc	10	`lf:5,ls:5,a:6`
[3/4]	aac	8	`lf:4,lp:4,rf:1,rp:1,rs:1,re:1,a:4`
[3/5]	cba	8	`lf:4,ls:4,a:7`
[3/6]	acb	6	`lf:3,lp:2,ls:1,rf:1,rp:1,rs:1,re:1,a:6`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aab=ca, abc=1⟩.