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) <-> w. Can we infer ~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. Finally, from R_25(a_25) and S_25(a_25) we can infer R_25(a_25) via simplification, which contradicts ~R_25(a_25). Therefore, the answer is no.