Morphocompletion for #6104 ⟨a, b, c | ab=c, cac=ca⟩

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(c) = 0, a < c; deg(b) = 1

Rewriting system is not complete: roundsLimit

#	Rule
1.	cac ⇒ ca
2.	caac ⇒ caa
3.	caaac ⇒ caaa
4.	caaaac ⇒ caaaa
5.	caaaaac ⇒ caaaaa
6.	caaaaaac ⇒ caaaaaa
7.	caaaaaaac ⇒ caaaaaaa
8.	caaaaaaaac ⇒ caaaaaaaa
9.	caaaaaaaaac ⇒ caaaaaaaaa
10.	caaaaaaaaaac ⇒ caaaaaaaaaa
11.	caaaaaaaaaaac ⇒ caaaaaaaaaaa
12.	caaaaaaaaaaaac ⇒ caaaaaaaaaaaa
13.	caaaaaaaaaaaaac ⇒ caaaaaaaaaaaaa
14.	caaaaaaaaaaaaaac ⇒ caaaaaaaaaaaaaa
15.	caaaaaaaaaaaaaaac ⇒ caaaaaaaaaaaaaaa
16.	caaaaaaaaaaaaaaaac ⇒ caaaaaaaaaaaaaaaa
17.	caaaaaaaaaaaaaaaaac ⇒ caaaaaaaaaaaaaaaaa
18.	caaaaaaaaaaaaaaaaaac ⇒ caaaaaaaaaaaaaaaaaa
19.	caaaaaaaaaaaaaaaaaaac ⇒ caaaaaaaaaaaaaaaaaaa
20.	ab ⇒ c
	...

Collecting factors up to length 4 / frequency 7:

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

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

Rewriting system is complete. See ⟨a, b, c | ab=c, cac=ca⟩.