Morphocompletion for #2400 ⟨a, b, c | aab=a, cbbc=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aab ⇒ a
2.	cbb ⇒ bbc
3.	acc ⇒ aaa
4.	abcc ⇒ aa
5.	bbcc ⇒ 1
6.	ccb ⇒ bcc
7.	acbcc ⇒ aaacb
8.	abcbcc ⇒ aacb
9.	bbcbcc ⇒ cb
10.	acbcbcc ⇒ aaacbcb
11.	abcbcbcc ⇒ aacbcb
12.	bbcbcbcc ⇒ cbcb
13.	acbcbcbcc ⇒ aaacbcbcb
14.	abcbcbcbcc ⇒ aacbcbcb
15.	bbcbcbcbcc ⇒ cbcbcb
16.	acbcbcbcbcc ⇒ aaacbcbcbcb
17.	abcbcbcbcbcc ⇒ aacbcbcbcb
18.	bbcbcbcbcbcc ⇒ cbcbcbcb
19.	bbcbcbcbcbcbcc ⇒ cbcbcbcbcb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	46	`lf:46,rf:24,rp:1,rs:1,a:2`
[2/1]	cb	39	`lf:37,lp:1,ls:1,rf:35,rp:5,rs:13,re:1,a:2`
[2/2]	cc	34	`lf:17,lp:1,ls:16,rf:1,rs:1,lprs:10,a:3`
[2/3]	bb	14	`lf:7,lp:6,ls:1,rf:1,rp:1,lsrp:10,a:2`
[2/4]	ab	12	`lf:6,lp:5,ls:1`
[2/5]	ac	10	`lf:5,lp:5,rf:8,a:6`
[2/6]	aa	2	`lf:1,lp:1,rf:15,rp:10,rs:2,re:1`
[3/0]	cbc	35	`lf:35,rf:22,rp:4,a:5`
[3/1]	bcb	31	`lf:31,rf:22,rs:10,a:5`
[3/2]	bcc	30	`lf:15,ls:15,rf:1,rp:1,rs:1,re:1,a:3`
[3/3]	bbc	12	`lf:6,lp:6,rf:1,rp:1,rs:1,re:1,a:2`
[3/4]	abc	10	`lf:5,lp:5,a:4`
[3/5]	acb	8	`lf:4,lp:4,rf:8,rs:2,lprs:1,a:7`
[3/6]	aac	0	`rf:8,rp:4,a:7`

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

Step 2

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

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