Morphocompletion for #6073 ⟨a, b, c | ab=c, bac=cc⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	acc ⇒ cac
2.	bac ⇒ cc
3.	bcac ⇒ ccc
4.	bccac ⇒ cccc
5.	bcccac ⇒ ccccc
6.	bccccac ⇒ cccccc
7.	bcccccac ⇒ ccccccc
8.	bccccccac ⇒ cccccccc
9.	bcccccccac ⇒ ccccccccc
10.	bccccccccac ⇒ cccccccccc
11.	bcccccccccac ⇒ ccccccccccc
12.	bccccccccccac ⇒ cccccccccccc
13.	bcccccccccccac ⇒ ccccccccccccc
14.	bccccccccccccac ⇒ cccccccccccccc
15.	bcccccccccccccac ⇒ ccccccccccccccc
16.	bccccccccccccccac ⇒ cccccccccccccccc
17.	bcccccccccccccccac ⇒ ccccccccccccccccc
18.	bccccccccccccccccac ⇒ cccccccccccccccccc
19.	bcccccccccccccccccac ⇒ ccccccccccccccccccc
20.	ab ⇒ c
	...

Collecting factors up to length 4 / frequency 7:

Considering [length 3 / frequency 1] cac=d.

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

Rewriting system is complete. See ⟨a, b, c | ab=c, bac=cc⟩.