Morphocompletion for #7225 ⟨a, b, c | aa=1, bacb=bc⟩

Solved by morph:2/1. (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: arenaWorkLimit

#	Rule
1.	aa ⇒ 1
2.	bacb ⇒ bc
3.	bcacb ⇒ bcc
4.	bccacb ⇒ bccc
5.	bcccacb ⇒ bcccc
6.	bccccacb ⇒ bccccc
7.	bcccccacb ⇒ bcccccc
8.	bccccccacb ⇒ bccccccc
9.	bcccccccacb ⇒ bcccccccc
10.	bccccccccacb ⇒ bccccccccc
11.	bcccccccccacb ⇒ bcccccccccc
12.	bccccccccccacb ⇒ bccccccccccc
13.	bcccccccccccacb ⇒ bcccccccccccc
14.	bccccccccccccacb ⇒ bccccccccccccc
15.	bcccccccccccccacb ⇒ bcccccccccccccc
16.	bccccccccccccccacb ⇒ bccccccccccccccc
17.	bcccccccccccccccacb ⇒ bcccccccccccccccc
18.	bccccccccccccccccacb ⇒ bccccccccccccccccc
19.	bcccccccccccccccccacb ⇒ bcccccccccccccccccc
20.	bccccccccccccccccccacb ⇒ bccccccccccccccccccc
	...

Collecting factors up to length 4 / frequency 7:

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

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

Rewriting system is complete. See ⟨a, b, c | aa=1, bacb=bc⟩.