Consider the following premises. R_10(c) or ~p. forall x_10: R_10(x_10) -> S_10(x_10). Can we infer p -> S_10(c) from them? If possible, name the inference rules being used at each step.
 From forall x_10: R_10(x_10) -> S_10(x_10) we can infer R_10(c) -> S_10(c) via universal instantiation. From R_10(c) or ~p we can infer p -> R_10(c) via rewriting. Finally, from p -> R_10(c), R_10(c) -> S_10(c) we can infer p -> S_10(c) via transitivity. Therefore, the answer is yes.