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