Morphocompletion for #7025 ⟨a, b, c | ab=1, bbbca=c⟩

Solved by morph:2/1,3/2,3/2. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: lhsLimit

#	Rule
1.	cb ⇒ bbbc
2.	bbbca ⇒ c
3.	bbbbbbbbbcca ⇒ cc
4.	bbbbbbbbbbbbbbbbbbbbbbbbbbbccca ⇒ ccc
5.	ab ⇒ 1
6.	ac ⇒ bbca
	...

Collecting factors up to length 4 / frequency 2:

Considering [length 2 / frequency 1] ca=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: workMaxLimit

#	Rule
1.	cb ⇒ bbbc
2.	bbbd ⇒ c
3.	db ⇒ c
4.	bbbbbbcd ⇒ dc
5.	bbbbbbbbbbbbbbbccd ⇒ ddc
6.	bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccd ⇒ dddc
7.	ca ⇒ d
8.	ab ⇒ 1
9.	ac ⇒ bbd
10.	ad ⇒ bbda
	...

Collecting factors up to length 4 / frequency 3:

Considering [length 3 / frequency 2] bbc=e.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: workMaxLimit

#	Rule
1.	eb ⇒ bbbe
2.	bbc ⇒ e
3.	cb ⇒ be
4.	bbbd ⇒ c
5.	db ⇒ c
6.	bec ⇒ de
7.	bbbbed ⇒ dc
8.	eec ⇒ bbdde
9.	cec ⇒ dde
10.	bbbbbbbeed ⇒ ddc
11.	bbbbbbbbbbbbbbbbeeed ⇒ dddc
12.	bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbeeeed ⇒ ddddc
13.	ea ⇒ bbd
14.	ca ⇒ d
15.	ab ⇒ 1
16.	ae ⇒ bc
17.	ac ⇒ bbd
18.	ad ⇒ bbda
	...

Collecting factors up to length 4 / frequency 3:

Considering [length 3 / frequency 2] bbe=f.

Auxiliary generators:
1. d = ca
2. e = bbc
3. f = bbe
Reduction order:
- Right-to-left recursive path with deg(b) = 0; deg(f) = deg(e) = deg(c) = deg(d) = 1, f < e < c < d; deg(a) = 2

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