Consider the following premises. W(a_8) -> w_4. forall x_10: ~P_10(x_10) or R_10(x_10). forall x_10: P_10(x_10) or W(x_10). w_4 -> u. R_10(a_8) -> u. Can we infer u from them? If possible, name the inference rules being used at each step.
 From forall x_10: P_10(x_10) or W(x_10), forall x_10: ~P_10(x_10) or R_10(x_10) we can infer forall x_10: W(x_10) or R_10(x_10) via universal resolution. From forall x_10: W(x_10) or R_10(x_10) we can infer W(a_8) or R_10(a_8) via universal instantiation. From W(a_8) -> w_4, w_4 -> u we can infer W(a_8) -> u via transitivity. Finally, from W(a_8) -> u, R_10(a_8) -> u, W(a_8) or R_10(a_8) we can infer u via disjunction elimination. Therefore, the answer is yes.