Morphocompletion for #175 ⟨a, b, c | aa=1, 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.	aa ⇒ 1
2.	bbc ⇒ cbb
3.	ccbb ⇒ 1
4.	bcc ⇒ ccb
5.	ccbcbb ⇒ bc
6.	ccbcbcbb ⇒ bcbc
7.	ccbcbcbcbb ⇒ bcbcbc
8.	ccbcbcbcbcbb ⇒ bcbcbcbc
9.	ccbcbcbcbcbcbb ⇒ bcbcbcbcbc
10.	ccbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbc
11.	ccbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbc
12.	ccbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbc
13.	ccbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbc
14.	ccbcbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbcbc
15.	ccbcbcbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbcbcbc
16.	ccbcbcbcbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbcbcbcbc
17.	ccbcbcbcbcbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbcbcbcbcbc
18.	ccbcbcbcbcbcbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbcbcbcbcbcbc
19.	ccbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbb ⇒ bcbcbcbcbcbcbcbcbcbcbcbcbcbcbc
	...

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, bccb=1⟩.