Morphocompletion for #2726 ⟨a, b, c | abc=a, bccb=1⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	acb ⇒ a
2.	abc ⇒ a
3.	bbc ⇒ cbb
4.	ccbb ⇒ 1
5.	accb ⇒ ac
6.	bcc ⇒ ccb
7.	ccbcbb ⇒ bc
8.	acccb ⇒ acc
9.	ccbcbcbb ⇒ bcbc
10.	accccb ⇒ accc
11.	ccbcbcbcbb ⇒ bcbcbc
12.	acccccb ⇒ acccc
13.	ccbcbcbcbcbb ⇒ bcbcbcbc
14.	accccccb ⇒ accccc
15.	ccbcbcbcbcbcbb ⇒ bcbcbcbcbc
16.	acccccccb ⇒ acccccc
17.	accccccccb ⇒ accccccc
18.	acccccccccb ⇒ acccccccc
19.	accccccccccb ⇒ accccccccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	59	`lf:52,lp:6,ls:1,rf:37,rp:1,rs:8,lsrp:10,a:3`
[2/1]	cb	41	`lf:31,ls:10,rf:12,rp:1,rs:1,a:2`
[2/2]	bc	21	`lf:18,lp:1,ls:2,rf:15,rp:5,rs:5,re:1`
[2/3]	ac	20	`lf:10,lp:10,rf:9,rp:9,rs:1,re:1,lprp:9,lprs:1,a:2`
[2/4]	bb	14	`lf:7,lp:1,ls:6,rf:1,rs:1,lprs:10,a:6`
[2/5]	ab	2	`lf:1,lp:1`
[3/0]	ccc	36	`lf:36,rf:28,rs:7,a:5`
[3/1]	ccb	30	`lf:15,lp:6,ls:9,rf:1,rp:1,rs:1,re:1,a:3`
[3/2]	acc	18	`lf:9,lp:9,rf:8,rp:8,rs:1,re:1,lprp:8,lprs:1,a:4`
[3/3]	cbc	15	`lf:15,rf:10,rs:4,a:8`
[3/4]	bcb	15	`lf:15,rf:10,rp:4,a:8`
[3/5]	cbb	12	`lf:6,ls:6,rf:1,rp:1,rs:1,re:1,a:6`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | abc=a, bccb=1⟩.