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

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) = 0; deg(a) = deg(c) = 1, a < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	bba ⇒ ab
2.	bc ⇒ cbb
3.	acbb ⇒ b
4.	bac ⇒ acb
5.	cba ⇒ 1
6.	acab ⇒ ba
7.	accbbbb ⇒ cbb
8.	cacb ⇒ c
9.	acaab ⇒ baba
10.	accabb ⇒ cab
11.	caccbb ⇒ cc
12.	ccac ⇒ caccb
13.	caccab ⇒ cca
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	17	`lf:10,lp:5,ls:2,rf:2,rp:1,lsrp:10,a:4`
[2/1]	bb	12	`lf:7,lp:1,ls:4,rf:2,rs:2,lsrs:1,a:2`
[2/2]	ca	11	`lf:8,lp:3,rf:3,rp:2,rs:1,lprs:1,a:5`
[2/3]	cb	7	`lf:5,lp:1,ls:1,rf:4,rp:2,rs:2,a:1`
[2/4]	ab	7	`lf:4,ls:3,rf:3,rp:1,rs:2,re:1,a:2`
[2/5]	cc	6	`lf:5,lp:1,rf:3,rp:2,rs:1,re:1,a:6`
[2/6]	ba	6	`lf:3,lp:1,ls:2,rf:3,rp:2,rs:2,re:1,a:1`
[3/0]	cac	8	`lf:4,lp:3,ls:1,rf:1,rp:1,lsrp:1,a:9`
[3/1]	acc	6	`lf:4,lp:2,rf:1,a:6`
[3/2]	cab	5	`lf:3,ls:2,rf:1,rp:1,rs:1,re:1,a:5`
[3/3]	cbb	5	`lf:3,ls:2,rf:2,rp:2,rs:2,re:2,a:3`
[3/4]	cca	4	`lf:3,lp:1,rf:1,rp:1,rs:1,re:1,a:12`
[3/5]	aca	4	`lf:2,lp:2,a:5`
[3/6]	acb	4	`lf:2,lp:1,ls:1,rf:1,rp:1,rs:1,re:1,a:4`

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(d) = 0, b < d; deg(a) = deg(c) = 1, a < c

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