Morphocompletion for #2429 ⟨a, b, c | aab=b, acca=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < b < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	aab ⇒ b
2.	caa ⇒ aac
3.	cca ⇒ acc
4.	ccb ⇒ b
5.	aacb ⇒ cb
6.	aacc ⇒ 1
7.	aacab ⇒ cab
8.	aacacb ⇒ cacb
9.	aacacc ⇒ ca
10.	aacacab ⇒ cacab
11.	aacacacb ⇒ cacacb
12.	aacacacc ⇒ caca
13.	aacacacab ⇒ cacacab
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	22	`lf:11,lp:10,ls:1,rf:1,rp:1,lsrp:10`
[2/1]	ac	18	`lf:18,rf:9,rp:1,rs:1,a:3`
[2/2]	ca	16	`lf:14,lp:1,ls:1,rf:12,rp:7,rs:2,re:1,a:3`
[2/3]	cc	10	`lf:5,lp:2,ls:3,rf:1,rs:1,lprs:10,a:3`
[2/4]	cb	8	`lf:4,ls:4,rf:3,rp:1,rs:3,re:1,lsrp:1,lsrs:3,a:4`
[2/5]	ab	8	`lf:4,ls:4,rf:3,rs:3,lsrs:3`
[3/0]	aac	18	`lf:9,lp:9,rf:1,rp:1,rs:1,re:1,a:5`
[3/1]	aca	12	`lf:12,rf:5,rs:1,a:6`
[3/2]	cac	9	`lf:9,rf:7,rp:5,a:6`
[3/3]	cab	6	`lf:3,ls:3,rf:3,rp:1,rs:3,re:1,lsrp:1,lsrs:3,a:10`
[3/4]	acc	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:3`
[3/5]	acb	6	`lf:3,ls:3,rf:2,rs:2,lsrs:2,a:7`

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

Step 2

Auxiliary generators:
1. d = aa
Reduction order:
- Left-to-right shortlex with a < b < c < d

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