Morphocompletion for #1470 ⟨a, b, c | ab=1, aca=ac⟩

Solved by morph:2/1. (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.	ab ⇒ 1
2.	aca ⇒ ac
3.	acb ⇒ ac
4.	acca ⇒ acc
5.	accb ⇒ acc
6.	accca ⇒ accc
7.	acccb ⇒ accc
8.	acccca ⇒ acccc
9.	accccb ⇒ acccc
10.	accccca ⇒ accccc
11.	acccccb ⇒ accccc
12.	acccccca ⇒ acccccc
13.	accccccb ⇒ acccccc
14.	accccccca ⇒ accccccc
15.	acccccccb ⇒ accccccc
16.	acccccccca ⇒ acccccccc
17.	accccccccb ⇒ acccccccc
18.	accccccccca ⇒ accccccccc
19.	acccccccccb ⇒ accccccccc
20.	acccccccccca ⇒ acccccccccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	81	`lf:81,rf:81,rs:17,a:3`
[2/1]	ac	38	`lf:19,lp:19,rf:19,rp:19,rs:2,re:2,lprp:19,lprs:2,a:1`
[2/2]	ca	20	`lf:10,ls:10,a:1`
[2/3]	cb	18	`lf:9,ls:9,a:2`
[3/0]	ccc	64	`lf:64,rf:64,rs:15,a:5`
[3/1]	acc	34	`lf:17,lp:17,rf:17,rp:17,rs:2,re:2,lprp:17,lprs:2,a:3`
[3/2]	cca	18	`lf:9,ls:9,a:3`
[3/3]	ccb	16	`lf:8,ls:8,a:4`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | ab=1, aca=ac⟩.