Morphocompletion for #7315 ⟨a, b, c | ab=1, aaca=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(a) = deg(b) = 0, a < b; deg(c) = 1

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	40	`lf:20,lp:17,ls:3,rf:18,rp:18,rs:1,re:1,lprp:17,lsrp:12,lprs:1,a:2`
[2/1]	ba	20	`lf:10,ls:10,a:4`
[2/2]	cb	15	`lf:15,rf:9,rs:6,a:2`
[2/3]	bb	14	`lf:14,rf:4,rs:3,a:7`
[2/4]	cc	13	`lf:13,rf:20,rs:3,a:5`
[2/5]	bc	10	`lf:5,ls:5,a:11`
[2/6]	ca	2	`lf:2,rf:5,rs:2,a:5`
[3/0]	acc	18	`lf:9,lp:9,rf:13,rp:13,rs:1,re:1,lprp:9,lprs:1,a:5`
[3/1]	acb	14	`lf:7,lp:7,rf:4,rp:4,rs:2,re:2,lprp:3,lprs:1,a:2`
[3/2]	bba	12	`lf:6,ls:6,a:7`
[3/3]	cbb	9	`lf:9,rf:3,rs:2,a:7`
[3/4]	ccb	8	`lf:8,rf:5,rs:4,a:5`
[3/5]	cba	8	`lf:4,ls:4,a:4`
[3/6]	bbc	6	`lf:3,ls:3,a:20`

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

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=1, aaca=ac⟩.