Consider the following premises. ~R_11(c) or r_7. p_2 or ~S_11(c). forall x_11: R_11(x_11) or S_11(x_11). r_7 -> p_2. Can we infer p_2 from them? If possible, name the inference rules being used at each step.
 From forall x_11: R_11(x_11) or S_11(x_11) we can infer R_11(c) or S_11(c) via universal instantiation. From R_11(c) or S_11(c), ~R_11(c) or r_7 we can infer S_11(c) or r_7 via resolution. From p_2 or ~S_11(c) we can infer S_11(c) -> p_2 via rewriting. Finally, from S_11(c) -> p_2, r_7 -> p_2, S_11(c) or r_7 we can infer p_2 via disjunction elimination. Therefore, the answer is yes.