Morphocompletion for #1585 ⟨a, b, c | aaa=bc, acb=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = 1; deg(c) = 2

Rewriting system is not complete: roundsLimit

#	Rule
1.	aaaba ⇒ b
2.	aaabb ⇒ baaba
3.	cba ⇒ 1
4.	cbb ⇒ aaba
5.	acaaa ⇒ c
6.	acb ⇒ 1
7.	acab ⇒ caba
8.	acaab ⇒ caaba
9.	bc ⇒ aaa
10.	bac ⇒ 1
11.	baac ⇒ caaaaaab
12.	baaca ⇒ caaab
13.	aabaac ⇒ cb
14.	ccb ⇒ acaa
15.	ccaaab ⇒ aca
16.	ccaaaaaab ⇒ ac
17.	acaac ⇒ ccaaa
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	23	`lf:19,lp:3,ls:1,rf:15,rp:2,rs:3`
[2/1]	ac	19	`lf:10,lp:5,ls:4,rf:3,rp:3,rs:1,re:1,a:1`
[2/2]	ab	11	`lf:7,ls:4,rf:6,rs:2,a:9`
[2/3]	ba	11	`lf:6,lp:3,ls:2,rf:5,rp:1,rs:4,a:7`
[2/4]	cb	8	`lf:4,lp:2,ls:2,rf:1,rp:1,rs:1,re:1,a:1`
[2/5]	ca	8	`lf:7,ls:1,rf:7,rp:4,rs:1,lsrp:1,a:2`
[2/6]	cc	6	`lf:3,lp:3,rf:1,rp:1,a:3`
[3/0]	aaa	11	`lf:8,lp:2,ls:1,rf:7,rp:1,rs:2,re:1`
[3/1]	aca	10	`lf:5,lp:4,ls:1,rf:2,rp:2,rs:1,re:1,a:2`
[3/2]	aab	10	`lf:6,lp:1,ls:3,rf:5,rp:1,rs:2,a:9`
[3/3]	aac	7	`lf:4,ls:3,a:4`
[3/4]	caa	5	`lf:5,rf:5,rp:3,rs:1,a:2`
[3/5]	baa	5	`lf:3,lp:2,rf:1,rp:1,a:9`
[3/6]	cca	4	`lf:2,lp:2,rf:1,rp:1,a:4`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aaa=bc, acb=1⟩.