Morphocompletion for #4332 ⟨a, b, c | aab=1, cbca=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(b) = deg(c) = 1, b < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	aab ⇒ 1
2.	cbaa ⇒ c
3.	cab ⇒ cba
4.	cbbaa ⇒ cb
5.	cbab ⇒ cbba
6.	cbc ⇒ cba
7.	cbbbaa ⇒ cbb
8.	cbbab ⇒ cbbba
9.	cbbc ⇒ cbba
10.	cbbac ⇒ cb
11.	cbbbbaa ⇒ cbbb
12.	cbbbab ⇒ cbbbba
13.	cbbbc ⇒ cbbba
14.	cbbbac ⇒ cbb
15.	cbbbbbaa ⇒ cbbbb
16.	cbbbbc ⇒ cbbbba
17.	cbbbbac ⇒ cbbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cb	30	`lf:15,lp:15,rf:15,rp:15,rs:2,re:2,lprp:14,lprs:2,a:2`
[2/1]	bb	25	`lf:25,rf:21,rs:5,a:4`
[2/2]	aa	12	`lf:6,lp:1,ls:5`
[2/3]	ba	11	`lf:11,rf:8,rs:8,a:2`
[2/4]	ab	10	`lf:5,ls:5`
[2/5]	bc	8	`lf:4,ls:4,a:2`
[2/6]	ac	6	`lf:3,ls:3,a:4`
[3/0]	cbb	24	`lf:12,lp:12,rf:11,rp:11,rs:2,re:2,lprp:10,lprs:2,a:4`
[3/1]	bbb	13	`lf:13,rf:10,rs:3,a:11`
[3/2]	baa	10	`lf:5,ls:5,a:7`
[3/3]	bba	9	`lf:9,rf:6,rs:6,a:4`
[3/4]	bbc	6	`lf:3,ls:3,a:10`
[3/5]	bac	6	`lf:3,ls:3,a:4`
[3/6]	bab	6	`lf:3,ls:3,a:8`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aab=1, cbca=c⟩.