Morphocompletion for #7400 ⟨a, b, c | ab=1, acaa=ac⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	ab ⇒ 1
2.	aca ⇒ acb
3.	acbb ⇒ ac
4.	acba ⇒ ac
5.	acca ⇒ accb
6.	accbb ⇒ acc
7.	accba ⇒ acc
8.	acbca ⇒ acbcb
9.	acbcbb ⇒ acbc
10.	acbcba ⇒ acbc
11.	accca ⇒ acccb
12.	acccbb ⇒ accc
13.	acccba ⇒ accc
14.	accbca ⇒ accbcb
15.	accbcbb ⇒ accbc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	28	`lf:14,lp:14,rf:14,rp:14,rs:2,re:2,lprp:14,lprs:2,a:2`
[2/1]	cb	14	`lf:14,rf:10,rs:5,a:2`
[2/2]	cc	11	`lf:11,rf:11,rs:4,a:5`
[2/3]	ca	10	`lf:5,ls:5,a:2`
[2/4]	bb	10	`lf:5,ls:5,a:6`
[2/5]	ba	8	`lf:4,ls:4,a:4`
[2/6]	bc	5	`lf:5,rf:5,rs:3,a:7`
[3/0]	acc	16	`lf:8,lp:8,rf:8,rp:8,rs:2,re:2,lprp:8,lprs:2,a:5`
[3/1]	acb	10	`lf:5,lp:5,rf:4,rp:4,rs:1,re:1,lprp:3,a:2`
[3/2]	cbb	10	`lf:5,ls:5,a:6`
[3/3]	cba	8	`lf:4,ls:4,a:4`
[3/4]	ccb	6	`lf:6,rf:4,rs:2,a:5`
[3/5]	cbc	5	`lf:5,rf:5,rs:3,a:7`
[3/6]	cca	4	`lf:2,ls:2,a:5`

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

Step 2

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

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