Consider the following premises. W(c) or q_2. forall x_10: W(x_10) -> S_10(x_10). S_10(c) or ~q_2. Can we infer ~S_10(c) from them? If possible, name the inference rules being used at each step.
 From forall x_10: W(x_10) -> S_10(x_10) we can infer W(c) -> S_10(c) via universal instantiation. From S_10(c) or ~q_2 we can infer q_2 -> S_10(c) via rewriting. Finally, from W(c) -> S_10(c), q_2 -> S_10(c), W(c) or q_2 we can infer S_10(c) via disjunction elimination, which contradicts ~S_10(c). Therefore, the answer is no.