Some species of tarantula make good pets.
Evidence
(Because there are quantifiers / conditional indicators / repeating ideas, it makes a lot of sense to turn this argument into Algebra)
Some tarantula's make good pets. Some A's are B.
No creature with poison No C's are B. fangs makes a good pet.
Conclusion
Not all tarantula's have poison fangs. Not all A's are C.
Evaluate
We don't really need to judge the validity of the logic here, but it is sound, for what it's worth.
Premise 2 says that "if poison fangs, then not good pet", which contraposes into "if good pet, then not poison fangs".
Thus, since Premise 1 says that "Some tarantulas make good pets", we can infer that "Some tarantulas do not have poison fangs".
Since this argument is using two negative quantifiers (no / not all), it's worth re-capping the negative to positive translations.
No A's are B = All A's are ~B Few A's are B = Most A's are ~B Not all A's are B = Some A's are ~B
At any point on LSAT they might trade one form for the other, and they're perfectly interchangeable.
We wrote our argument as
Premise 1: Some A's are B. Premise 2: No C's are B. Conclusion: Not all A's are C.
But we could have written it interchangeably as
Premise 1: Some A's are B. Premise 2: All C's are ~B. (All B's are ~C). Conclusion: Some A's are ~C.
Goal
We know we need two premises and one conclusion.
The two premises should be a mix: 1 some / not all claim 1 no / all claim
The conclusion is a some / not all claim.
Assuming an answer has those basic ingredients, we'll make sure that the Some / Not All premise gives us an idea that triggers the No / All premise.