Consider the following premises. p_4 -> R_13(a_13). forall x_13: R_13(x_13) -> S_13(x_13). ~r or p_4. w -> S_13(a_13). r or w. Can we infer ~S_13(a_13) from them? If possible, name the inference rules being used at each step.
 From forall x_13: R_13(x_13) -> S_13(x_13) we can infer R_13(a_13) -> S_13(a_13) via universal instantiation. From p_4 -> R_13(a_13), R_13(a_13) -> S_13(a_13) we can infer p_4 -> S_13(a_13) via transitivity. From r or w, ~r or p_4 we can infer w or p_4 via resolution. Finally, from w -> S_13(a_13), p_4 -> S_13(a_13), w or p_4 we can infer S_13(a_13) via disjunction elimination, which contradicts ~S_13(a_13). Therefore, the answer is no.