Consider the following premises. R_32(a_32) or t. forall x_32: R_32(x_32) -> S_32(x_32). w_1 -> ~S_32(a_32). ~s_2. t -> S_32(a_32). s_2 <-> s. Can we infer ~w_1 and ~s from them? If possible, name the inference rules being used at each step.
 From forall x_32: R_32(x_32) -> S_32(x_32) we can infer R_32(a_32) -> S_32(a_32) via universal instantiation. From R_32(a_32) -> S_32(a_32), t -> S_32(a_32), R_32(a_32) or t we can infer S_32(a_32) via disjunction elimination. From s_2 <-> s, ~s_2 we can infer ~s via biconditional elimination. From w_1 -> ~S_32(a_32), S_32(a_32) we can infer ~w_1 via modus tollens. Finally, from ~w_1, ~s we can infer ~w_1 and ~s via conjunction. Therefore, the answer is yes.