Morphocompletion for #6177 ⟨a, b, c | aa=1, abcacb=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.	aa ⇒ 1
2.	babc ⇒ acbaba
3.	cacbab ⇒ 1
4.	bcac ⇒ acacba
5.	cacbcbab ⇒ abca
6.	cacbcbcbab ⇒ abcbca
7.	cacbcbcbcbab ⇒ abcbcbca
8.	cacbcbcbcbaba ⇒ abcbcbc
9.	cacbcbcbcbcbab ⇒ abcbcbcbca
10.	cacbcbcbcbcbaba ⇒ abcbcbcbc
11.	cacbcbcbcbcbcbab ⇒ abcbcbcbcbca
12.	cacbcbcbcbcbcbaba ⇒ abcbcbcbcbc
13.	cacbcbcbcbcbcbcbab ⇒ abcbcbcbcbcbca
14.	cacbcbcbcbcbcbcbaba ⇒ abcbcbcbcbcbc
	...

Collecting factors up to length 4 / frequency 7:

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

Auxiliary generators:
1. d = cb
Reduction order:
- Left-to-right 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 | aa=1, abcacb=1⟩.