Morphocompletion for #5911 ⟨a, b, c | ab=a, caa=bc⟩

Solved by morph:2/1. (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.	ab ⇒ a
2.	acb ⇒ ac
3.	acaa ⇒ ac
4.	bc ⇒ caa
5.	accb ⇒ acc
6.	accaa ⇒ acc
7.	acccb ⇒ accc
8.	acccaa ⇒ accc
9.	accccb ⇒ acccc
10.	accccaa ⇒ acccc
11.	acccccb ⇒ accccc
12.	acccccaa ⇒ accccc
13.	accccccb ⇒ acccccc
14.	accccccaa ⇒ acccccc
15.	acccccccb ⇒ accccccc
16.	acccccccaa ⇒ accccccc
17.	accccccccb ⇒ acccccccc
18.	accccccccaa ⇒ acccccccc
19.	acccccccccb ⇒ accccccccc
20.	acccccccccaa ⇒ accccccccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	72	`lf:72,rf:72,rs:16,a:4`
[2/1]	ac	36	`lf:18,lp:18,rf:18,rp:18,rs:2,re:2,lprp:18,lprs:2,a:2`
[2/2]	cb	18	`lf:9,ls:9,a:3`
[2/3]	aa	18	`lf:9,ls:9,rf:1,rs:1,a:1`
[2/4]	ca	9	`lf:9,rf:1,rp:1,a:1`
[3/0]	ccc	56	`lf:56,rf:56,rs:14,a:6`
[3/1]	acc	32	`lf:16,lp:16,rf:16,rp:16,rs:2,re:2,lprp:16,lprs:2,a:4`
[3/2]	caa	18	`lf:9,ls:9,rf:1,rp:1,rs:1,re:1,a:1`
[3/3]	ccb	16	`lf:8,ls:8,a:5`
[3/4]	cca	8	`lf:8,a:4`
[3/5]	aca	2	`lf:1,lp:1,a:2`

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

Step 2

Auxiliary generators:
1. d = ac
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 | ab=a, caa=bc⟩.