Morphocompletion for #7071 ⟨a, b, c | ab=1, bccca=c⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccca ⇒ ac
2.	cb ⇒ bccc
3.	ab ⇒ 1
4.	bac ⇒ c
5.	baac ⇒ ac
6.	baaac ⇒ aac
7.	baaaac ⇒ aaac
8.	baaaaac ⇒ aaaac
9.	baaaaaac ⇒ aaaaac
10.	baaaaaaac ⇒ aaaaaac
11.	baaaaaaaac ⇒ aaaaaaac
12.	baaaaaaaaac ⇒ aaaaaaaac
13.	baaaaaaaaaac ⇒ aaaaaaaaac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	45	`lf:45,rf:36,rp:8,a:5`
[2/1]	ba	20	`lf:10,lp:10,a:4`
[2/2]	ac	20	`lf:10,ls:10,rf:10,rp:2,rs:10,re:2,lsrp:1,lsrs:9,a:2`
[2/3]	cc	3	`lf:2,lp:1,rf:2,rs:1,a:2`
[2/4]	ca	2	`lf:1,ls:1,a:2`
[2/5]	bc	0	`rf:1,rp:1,a:3`
[3/0]	aaa	36	`lf:36,rf:28,rp:7,a:6`
[3/1]	baa	18	`lf:9,lp:9,a:5`
[3/2]	aac	18	`lf:9,ls:9,rf:8,rp:1,rs:8,re:1,lsrp:1,lsrs:8,a:5`
[3/3]	cca	2	`lf:1,ls:1,a:2`
[3/4]	ccc	2	`lf:1,lp:1,rf:1,rs:1,a:2`
[3/5]	bcc	0	`rf:1,rp:1,a:3`

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

Step 2

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

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