Morphocompletion for #1997 ⟨a, b, c | abc=bb, cba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	18	`lf:11,lp:2,ls:5,rf:6,rp:3,rs:4,re:2,lsrp:2,lprs:1,lsrs:2,a:2`
[2/1]	ac	16	`lf:10,lp:4,ls:2,rf:2,rp:2,lsrp:11,a:4`
[2/2]	ba	12	`lf:7,lp:3,ls:2,rf:3,rp:2,rs:1,lprp:1,a:1`
[2/3]	cb	10	`lf:8,lp:1,ls:1,rf:3,rp:1,rs:1,a:1`
[2/4]	ca	5	`lf:3,lp:2,a:5`
[2/5]	ab	4	`lf:2,ls:2,rf:3,rp:1,rs:3,re:1,lsrs:1,a:2`
[2/6]	cc	1	`lf:1,rf:1,rp:1,rs:1,re:1,a:24`
[3/0]	acb	10	`lf:6,lp:3,ls:1,rf:2,rp:2,rs:1,re:1,a:4`
[3/1]	cbb	9	`lf:6,ls:3,rf:2,rp:1,rs:1,a:3`
[3/2]	bbb	6	`lf:3,lp:1,ls:2,rf:1,rs:1,a:2`
[3/3]	bba	5	`lf:3,lp:1,ls:1,rf:1,rp:1,rs:1,re:1,a:2`
[3/4]	cac	4	`lf:2,lp:2,a:22`
[3/5]	bac	4	`lf:2,lp:1,ls:1,a:9`
[3/6]	aca	2	`lf:1,lp:1,a:5`

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

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

Rewriting system is complete. See ⟨a, b, c | abc=bb, cba=1⟩.