Morphocompletion for #4532 ⟨a, b, c | abc=1, acaa=c⟩

Solved by morph:2/5. (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.	acaa ⇒ c
2.	bca ⇒ 1
3.	abc ⇒ 1
4.	abac ⇒ baca
5.	abaac ⇒ baaca
6.	abaaac ⇒ baaaca
7.	abaaaac ⇒ baaaaca
8.	abaaaaac ⇒ baaaaaca
9.	cbc ⇒ aca
10.	cbac ⇒ aaca
11.	cbaac ⇒ aaaca
12.	cbaaca ⇒ aac
13.	cbaaac ⇒ aaaaca
14.	cbaaaac ⇒ aaaaaca
15.	cbaaaaca ⇒ aaaac
16.	acc ⇒ ccaaaa
17.	acac ⇒ ccaa
18.	bcc ⇒ caa
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	28	`lf:15,lp:3,ls:10,rf:12,rp:1,rs:2,a:1`
[2/1]	aa	22	`lf:21,ls:1,rf:29,rp:6,rs:3,a:1`
[2/2]	cb	14	`lf:7,lp:7,a:2`
[2/3]	ab	12	`lf:6,lp:6`
[2/4]	ba	11	`lf:11,rf:5,rp:5,a:6`
[2/5]	bc	8	`lf:4,lp:2,ls:2`
[2/6]	ca	8	`lf:5,ls:3,rf:13,rp:1,rs:10,a:1`
[3/0]	aac	16	`lf:9,ls:7,rf:10,rp:2,rs:2,re:1,a:9`
[3/1]	cba	12	`lf:6,lp:6,a:9`
[3/2]	aaa	11	`lf:11,rf:16,rp:4,rs:1,a:15`
[3/3]	aba	10	`lf:5,lp:5,a:6`
[3/4]	baa	9	`lf:9,rf:4,rp:4,a:11`
[3/5]	aca	8	`lf:4,lp:2,ls:2,rf:10,rp:1,rs:10,re:1,a:1`
[3/6]	bac	4	`lf:2,ls:2,rf:1,rp:1,lsrp:10,a:6`

Considering [length 2 / frequency 5] bc=d.

Step 2

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

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