Consider the following premises. p -> ~S(a_11). forall x_12: S(x_12). forall x_12: Q_12(x_12). Can we infer ~p from them? If possible, name the inference rules being used at each step.
 From forall x_12: S(x_12), forall x_12: Q_12(x_12) we can infer forall x_12: S(x_12) and Q_12(x_12) via universal conjunction. From forall x_12: S(x_12) and Q_12(x_12) we can infer S(a_11) and Q_12(a_11) via universal instantiation. From S(a_11) and Q_12(a_11) we can infer S(a_11) via simplification. Finally, from p -> ~S(a_11), S(a_11) we can infer ~p via modus tollens. Therefore, the answer is yes.