Consider the following premises. S_17(a_17) -> t_2. forall x_17: R_17(x_17) or S_17(x_17). p_4 <-> t_2. R_17(a_17) -> t_2. Can we infer ~p_4 from them? If possible, name the inference rules being used at each step.
 From forall x_17: R_17(x_17) or S_17(x_17) we can infer R_17(a_17) or S_17(a_17) via universal instantiation. From R_17(a_17) -> t_2, S_17(a_17) -> t_2, R_17(a_17) or S_17(a_17) we can infer t_2 via disjunction elimination. From p_4 <-> t_2 we can infer t_2 -> p_4 via biconditional elimination. Finally, from t_2 -> p_4, t_2 we can infer p_4 via modus ponens, which contradicts ~p_4. Therefore, the answer is no.