It might be worth noting that this kind of question can be answered at least two ways as corollaries of the structure theorem for finitely-generated modules over a PID. (In particular, for abelian groups, such questions are definitely answerable, unlike more general "word problems" in non-abelian groups.) Let's write things additively, rather than multiplicatively, and reframe the question as asking whether $(5,0)$, $(0,7)$, and $(11,11)$ generate all of $\mathbb Z^2$.
An algorithmic approach uses the fact that $\mathbb Z$ is Euclidean, so that the following approach will terminate: doing a sort of row reduction to the matrix $\pmatrix{5&0\cr 0&7\cr 11&11}$, first subtract $2$ times the top row from the third, then $5$ times the third from the first, etc. Eventually, we obtain $\pmatrix{0&0\cr 0&1\cr 1&0}$ (or equivalent), so those three vectors do generate the whole $\mathbb Z^2$.
More directly (but not so algorithmically), consider the $3$ two-by-two minors, $35,55,77$. Their gcd is $1$, so (by the theorem, and a little exterior algebra) those three "vectors" generate all of $\mathbb Z^2$.