Morphocompletion for #3071 ⟨a, b, c | abc=b, bca=c⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ba ⇒ ac
2.	bca ⇒ c
3.	abc ⇒ b
4.	acbc ⇒ bb
5.	bcb ⇒ cbc
6.	accbc ⇒ bbb
7.	cbcca ⇒ bcc
8.	abbcc ⇒ bbcca
9.	acccbc ⇒ bbbb
10.	cbccca ⇒ bbcc
11.	bccbc ⇒ cbccb
12.	bbcccaa ⇒ aacbbcc
13.	bbbcca ⇒ acbbcc
14.	abbbcc ⇒ bbccca
15.	accccbc ⇒ bbbbb
16.	cbcccca ⇒ bbbcc
17.	bcccbc ⇒ cbccbb
18.	bbbccca ⇒ acbbbcc
19.	abbbbcc ⇒ bbcccca
20.	acccccbc ⇒ bbbbbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	33	`lf:21,lp:4,ls:8,rf:12,rp:1,rs:1,lprs:10`
[2/1]	cc	30	`lf:27,ls:3,rf:14,rs:6,a:5`
[2/2]	cb	15	`lf:11,lp:3,ls:1,rf:8,rp:3,rs:1,lsrp:10,a:3`
[2/3]	bb	14	`lf:11,lp:3,rf:26,rp:10,rs:6,re:1,a:4`
[2/4]	ca	13	`lf:7,ls:6,rf:3,rs:3,a:1`
[2/5]	ac	10	`lf:5,lp:5,rf:4,rp:3,rs:1,re:1,a:2`
[2/6]	ab	8	`lf:4,lp:4`
[3/0]	cbc	20	`lf:10,lp:3,ls:7,rf:3,rp:3,rs:1,re:1,lsrp:2,a:3`
[3/1]	bcc	16	`lf:11,lp:2,ls:3,rf:11,rp:1,rs:6,re:1,a:6`
[3/2]	ccc	12	`lf:12,rf:3,a:8`
[3/3]	cca	11	`lf:6,ls:5,rf:3,rs:3,a:6`
[3/4]	acc	8	`lf:4,lp:4,a:5`
[3/5]	bbb	7	`lf:5,lp:2,rf:12,rp:5,rs:4,re:1,a:5`
[3/6]	bbc	7	`lf:6,lp:1,rf:8,rp:4,a:9`

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

Step 2

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

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