Morphocompletion for #3431 ⟨a, b, c | ba=ab, cac=b⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with c < b < a

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ ba
2.	cac ⇒ b
3.	bac ⇒ cba
4.	acba ⇒ baac
5.	cbaac ⇒ bba
6.	bbaac ⇒ cbbaa
7.	accba ⇒ baacc
8.	acbba ⇒ baacb
9.	acccba ⇒ baaccc
10.	accbba ⇒ baaccb
11.	acbcba ⇒ baacbc
12.	acbbba ⇒ baacbb
13.	cbbaaac ⇒ bbbaa
14.	bbbaaac ⇒ cbbbaaa
15.	accccba ⇒ baacccc
16.	acccbba ⇒ baacccb
17.	accbcba ⇒ baaccbc
18.	accbbba ⇒ baaccbb
19.	acbccba ⇒ baacbcc
20.	acbcbba ⇒ baacbcb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	38	`lf:19,lp:13,ls:6,rf:13,rs:1,lprs:1,a:1`
[2/1]	ba	32	`lf:18,lp:1,ls:13,rf:19,rp:14,rs:3,re:1,lsrp:13,lprs:10`
[2/2]	cb	21	`lf:19,lp:2,rf:13,rp:3,rs:4,a:2`
[2/3]	bb	14	`lf:12,lp:2,rf:8,rp:2,rs:2,a:4`
[2/4]	cc	12	`lf:12,rf:12,rs:4,a:7`
[2/5]	aa	6	`lf:6,rf:17,rs:3,a:3`
[2/6]	bc	4	`lf:4,rf:4,rs:2,a:13`
[3/0]	bba	16	`lf:9,lp:1,ls:6,rf:4,rp:1,rs:1,re:1,a:4`
[3/1]	cba	16	`lf:8,lp:1,ls:7,rf:1,rp:1,rs:1,re:1,a:2`
[3/2]	acc	14	`lf:7,lp:7,rf:7,rs:1,lprs:1,a:7`
[3/3]	acb	12	`lf:6,lp:6,rf:5,rs:1,lprs:1,a:3`
[3/4]	aac	8	`lf:4,ls:4,rf:13,rs:1,a:3`
[3/5]	cbb	8	`lf:7,lp:1,rf:4,rp:2,rs:2,a:5`
[3/6]	ccb	8	`lf:8,rf:4,rs:2,a:7`

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

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