Morphocompletion for #3536 ⟨a, b, c | bb=ac, caa=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Right-to-left recursive path with deg(c) = 0; deg(b) = 1; deg(a) = 2

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4 / frequency 7:

[2/0]	ab	45	`lf:45,rf:36,rp:8,a:3`
[2/1]	ba	45	`lf:45,rf:36,rp:8,a:2`
[2/2]	bb	36	`lf:18,lp:9,ls:9,rf:10,rp:2,rs:10,re:2,lsrp:1,lprs:4,lsrs:9`
[2/3]	aa	20	`lf:10,ls:10,rf:9,rp:1,rs:9,re:1,lsrp:1,lsrs:9,a:1`
[2/4]	ca	20	`lf:10,lp:10,a:1`
[3/0]	aba	36	`lf:36,rf:28,rp:7,a:5`
[3/1]	bab	36	`lf:36,rf:28,rp:7,a:4`
[3/2]	baa	18	`lf:9,ls:9,rf:8,rp:1,rs:8,re:1,lsrp:1,lsrs:8,a:2`
[3/3]	abb	18	`lf:9,ls:9,rf:8,rp:1,rs:8,re:1,lsrp:1,lsrs:8,a:3`
[3/4]	cab	18	`lf:9,lp:9,a:3`
[3/5]	bba	18	`lf:9,lp:9,a:2`

Considering [length 3 / frequency 0] aba=d.

Auxiliary generators:
1. d = aba
Reduction order:
- Right-to-left recursive path with deg(d) = deg(c) = 0, d < c; deg(b) = 1; deg(a) = 2

Rewriting system is complete. See ⟨a, b, c | bb=ac, caa=a⟩.