Consider the following premises. ~p_2 or Q_1(h). forall x_13: Q_1(x_13) -> S_13(x_13). u_4 <-> S_13(h). p_2 or u_4. Can we infer ~S_13(h) from them? If possible, name the inference rules being used at each step.
 From forall x_13: Q_1(x_13) -> S_13(x_13) we can infer Q_1(h) -> S_13(h) via universal instantiation. From u_4 <-> S_13(h) we can infer u_4 -> S_13(h) via biconditional elimination. From p_2 or u_4, ~p_2 or Q_1(h) we can infer u_4 or Q_1(h) via resolution. Finally, from u_4 -> S_13(h), Q_1(h) -> S_13(h), u_4 or Q_1(h) we can infer S_13(h) via disjunction elimination, which contradicts ~S_13(h). Therefore, the answer is no.