Morphocompletion for #2794 ⟨a, b, c | abc=b, caaa=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: lhsLimit

#	Rule
1.	cb ⇒ bccc
2.	abc ⇒ b
3.	abbccc ⇒ bb
4.	abbbccccccccc ⇒ bbb
5.	abbbbccccccccccccccccccccccccccc ⇒ bbbb
6.	cab ⇒ bcc
7.	bab ⇒ abbcc
8.	caab ⇒ bc
9.	baab ⇒ abbc
10.	caaa ⇒ 1
11.	baaa ⇒ ab
	...

Collecting factors up to length 4 / frequency 2:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: workMaxLimit

#	Rule
1.	cb ⇒ bccc
2.	dc ⇒ b
3.	cd ⇒ bcc
4.	dbcc ⇒ bd
5.	dbbccccc ⇒ bdd
6.	dbbbcccccccccccccc ⇒ bddd
7.	dbbbbccccccccccccccccccccccccccccccccccccccccc ⇒ bdddd
8.	ab ⇒ d
9.	cad ⇒ bc
10.	bad ⇒ dbc
11.	dad ⇒ adbc
12.	caad ⇒ b
13.	baad ⇒ db
14.	daad ⇒ adb
15.	caaa ⇒ 1
16.	baaa ⇒ d
17.	daaa ⇒ ad
	...

Collecting factors up to length 4 / frequency 3:

Considering [length 2 / frequency 2] ad=e.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4 / frequency 3:

Considering [length 2 / frequency 1] ae=f.

Auxiliary generators:
1. d = ab
2. e = ad
3. f = ae
Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(b) = deg(d) = deg(e) = deg(f) = 1, b < d < e < f; deg(a) = 2

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