Clearly |x|≤1. As x runs over [−1,1], the vector u=(ax,a√1−x2) runs over all vectors of length a in the plane having a non negative vertical component.
Putting v=(by b√1−y2,w=(cz,c√1−z2), the system becomes u+v=w, with vectors u, v, w of lengths a, b, c respectively in the upper half-plane. the a, b, c are sides of a (possibly degenerate) triangle; i.e. |a−b|≤c≤a+b is a necessary condition.
Conversely, if a, b, c satisfy this condition, one constructs a triangle OMN with OM=a,ON=b,MN=c. If the vectors →OM,→ON have a positive nonnegative component, then so does their sum. For every such triangle, putting u=→OM,v=→ON, and w=→OM+→ON given a solution, and every solution is given by one such triangle. This triangle is uniquely determined up to congruence: α=angle MON=angle(u,v) and β=angle (u,w).
Therefore, all solutions of the system are
x=cost,y=cos(t+α),z=y=cos(t+β),tϵ[0,π−α] or
x=cost,y=cos(t−α),z=y=cos(t−β),tϵ[α,π].