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