Morphocompletion for #1355 ⟨a, b, c | ab=1, bbca=c⟩

Solved by morph:2/0,2/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: workMaxLimit

#	Rule
1.	cb ⇒ bbc
2.	ab ⇒ 1
3.	bac ⇒ c
4.	bca ⇒ ac
5.	aac ⇒ ca
6.	bbcca ⇒ cac
7.	acac ⇒ bcca
8.	bbbbccca ⇒ ccac
9.	accac ⇒ bbbccca
10.	bbbbbbbbcccca ⇒ cccac
11.	acccac ⇒ bbbbbbbcccca
	...

Collecting factors up to length 4 / frequency 4:

[2/0]	ac	16	`lf:8,lp:3,ls:5,rf:4,rp:1,rs:4,re:1,a:2`
[2/1]	bb	14	`lf:11,lp:3,rf:9,rp:3,a:3`
[2/2]	ca	11	`lf:7,ls:4,rf:7,rp:2,rs:4,re:1,lsrp:1,a:2`
[2/3]	cc	9	`lf:9,rf:9,rp:2,a:5`
[3/0]	bbb	10	`lf:8,lp:2,rf:6,rp:2,a:7`
[3/1]	cca	8	`lf:5,ls:3,rf:5,rp:1,rs:3,lsrp:1,a:5`
[3/2]	cac	6	`lf:3,ls:3,rf:3,rp:1,rs:3,re:1,a:5`
[3/3]	acc	4	`lf:2,lp:2,a:8`

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

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	cb ⇒ bbc
2.	bd ⇒ c
3.	db ⇒ bc
4.	ab ⇒ 1
5.	ac ⇒ d
6.	bcd ⇒ dc
7.	bad ⇒ d
8.	ca ⇒ ad
9.	adc ⇒ cd
10.	bccd ⇒ ddc
11.	aad ⇒ da
12.	addc ⇒ ccd
13.	bcccd ⇒ dddc
14.	adad ⇒ cda
15.	adddc ⇒ cccd
16.	bccccd ⇒ ddddc
17.	addad ⇒ ccda
18.	addddc ⇒ ccccd
	...

Collecting factors up to length 6 / frequency 3:

[2/0]	ad	20	`lf:10,lp:6,ls:4,rf:1,rp:1,rs:1,re:1,a:6`
[2/1]	cd	8	`lf:4,ls:4,rf:6,rp:2,rs:4,re:1,a:8`
[2/2]	dc	8	`lf:4,ls:4,rf:4,rp:1,rs:4,re:1,a:8`
[3/0]	add	8	`lf:4,lp:4,a:13`
[3/1]	ccd	6	`lf:3,ls:3,rf:4,rp:2,rs:3,re:1,a:12`
[3/2]	ddc	6	`lf:3,ls:3,rf:3,rp:1,rs:3,re:1,a:12`
[4/0]	addd	4	`lf:2,lp:2,a:19`
[4/1]	cccd	4	`lf:2,ls:2,rf:2,rp:1,rs:2,re:1,a:18`
[4/2]	dddc	4	`lf:2,ls:2,rf:2,rp:1,rs:2,re:1,a:18`
[5/0]	adddd	2	`lf:1,lp:1,a:23`
[5/1]	ccccd	2	`lf:1,ls:1,rf:1,rp:1,rs:1,re:1,a:22`
[5/2]	ddddc	2	`lf:1,ls:1,rf:1,rp:1,rs:1,re:1,a:22`

Considering [length 2 / frequency 0] ad=e.

Step 3

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

Rewriting system is complete. See ⟨a, b, c | ab=1, bbca=c⟩.