Morphocompletion for #7837 ⟨a, b, c | ab=1, cac=bba⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ 1
2.	bacb ⇒ cb
3.	baccb ⇒ ccb
4.	bacccb ⇒ cccb
5.	baccccb ⇒ ccccb
6.	bacccccb ⇒ cccccb
7.	cacb ⇒ bb
8.	caccb ⇒ bcb
9.	cacccb ⇒ bccb
10.	caccccb ⇒ bcccb
11.	cacccccb ⇒ bccccb
12.	bba ⇒ cac
13.	acac ⇒ ba
14.	baac ⇒ acba
15.	baccac ⇒ ccac
16.	bacccac ⇒ cccac
17.	caccac ⇒ bcac
18.	cacccac ⇒ bccac
19.	aacba ⇒ aac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	29	`lf:22,lp:1,ls:6,rf:7,rp:1,rs:6,lsrp:1,lsrs:4,a:1`
[2/1]	cc	26	`lf:26,rf:20,rp:6,a:4`
[2/2]	cb	21	`lf:11,ls:10,rf:10,rp:1,rs:9,re:1,lsrp:1,lsrs:9,a:3`
[2/3]	ba	20	`lf:10,lp:8,ls:2,rf:2,rp:1,rs:2,re:1,lprs:1,a:1`
[2/4]	ca	19	`lf:12,lp:7,rf:5,rp:1,a:1`
[2/5]	aa	3	`lf:2,lp:1,rf:1,rp:1,lprp:1,a:5`
[2/6]	bb	2	`lf:1,lp:1,rf:1,rp:1,rs:1,re:1,a:1`
[3/0]	cac	24	`lf:12,lp:7,ls:5,rf:5,rp:1,rs:5,re:1,lprs:2,lsrs:4,a:1`
[3/1]	ccb	16	`lf:8,ls:8,rf:7,rp:1,rs:7,re:1,lsrp:1,lsrs:7,a:11`
[3/2]	bac	14	`lf:7,lp:7,a:9`
[3/3]	ccc	14	`lf:14,rf:10,rp:4,a:14`
[3/4]	acc	12	`lf:12,a:4`
[3/5]	acb	5	`lf:3,ls:2,rf:1,rp:1,a:3`
[3/6]	aac	4	`lf:2,lp:1,ls:1,rf:1,rp:1,rs:1,re:1,lprp:1,lprs:1,a:5`

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

Step 2

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

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