Consider the following premises. q_3 -> ~S_16(a_16). R_16(a_16) or p_2. forall x_16: R_16(x_16) <-> S_16(x_16). p_2 -> S_16(a_16). Can we infer ~q_3 from them? If possible, name the inference rules being used at each step.
 From forall x_16: R_16(x_16) <-> S_16(x_16) we can infer R_16(a_16) <-> S_16(a_16) via universal instantiation. From R_16(a_16) <-> S_16(a_16) we can infer R_16(a_16) -> S_16(a_16) via biconditional elimination. From R_16(a_16) -> S_16(a_16), p_2 -> S_16(a_16), R_16(a_16) or p_2 we can infer S_16(a_16) via disjunction elimination. Finally, from q_3 -> ~S_16(a_16), S_16(a_16) we can infer ~q_3 via modus tollens. Therefore, the answer is yes.