Consider the following premises. forall x_25: R_25(x_25) and S_25(x_25). forall x_14: ~R_14(x_14). R_14(a_14) <-> p. Can we infer ~p and R_25(a_25) from them? If possible, name the inference rules being used at each step.
 From forall x_25: R_25(x_25) and S_25(x_25) we can infer R_25(a_25) and S_25(a_25) via universal instantiation. From R_25(a_25) and S_25(a_25) we can infer R_25(a_25) via simplification. From forall x_14: ~R_14(x_14) we can infer ~R_14(a_14) via universal instantiation. From R_14(a_14) <-> p, ~R_14(a_14) we can infer ~p via biconditional elimination. Finally, from ~p, R_25(a_25) we can infer ~p and R_25(a_25) via conjunction. Therefore, the answer is yes.