Morphocompletion for #7539 ⟨a, b, c | ab=1, bbcc=cb⟩

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

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	ab ⇒ 1
2.	bacb ⇒ cb
3.	baacb ⇒ acb
4.	baaacbb ⇒ aacbb
5.	baaaacbb ⇒ aaacbb
6.	baaaaacbb ⇒ aaaacbb
7.	cc ⇒ aacb
8.	baaacbcb ⇒ aacbcb
9.	baaaacbcb ⇒ aaacbcb
10.	bacacb ⇒ cacb
11.	baacacb ⇒ acacb
12.	caacb ⇒ aacbc
13.	bacacacb ⇒ cacacb
14.	caacacb ⇒ aacacbc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cb	23	`lf:14,ls:9,rf:15,rp:1,rs:8,re:1,lsrp:1,lsrs:7,a:3`
[2/1]	ba	20	`lf:10,lp:10,a:9`
[2/2]	aa	18	`lf:18,rf:12,rp:8,a:3`
[2/3]	ac	17	`lf:17,rf:15,rp:2,a:3`
[2/4]	ca	9	`lf:7,lp:2,rf:5,rp:2,a:5`
[2/5]	bb	6	`lf:3,ls:3,rf:3,rs:3,lsrs:3,a:27`
[2/6]	bc	2	`lf:2,rf:4,rs:2,a:5`
[3/0]	acb	19	`lf:12,ls:7,rf:12,rp:1,rs:5,re:1,lsrp:1,lsrs:4,a:3`
[3/1]	baa	14	`lf:7,lp:7,a:9`
[3/2]	aac	9	`lf:9,rf:8,rp:5,a:3`
[3/3]	aaa	9	`lf:9,rf:4,rp:3,a:27`
[3/4]	cbb	6	`lf:3,ls:3,rf:3,rs:3,lsrs:3,a:27`
[3/5]	bac	6	`lf:3,lp:3,a:23`
[3/6]	cac	5	`lf:5,rf:5,rp:2,a:8`

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

Step 2

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

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