Consider the following premises. For all x_3, if x_3 were a nurse, then x_3 is running. For all x_3, if x_3 were poor, then x_3 is running. For all x_3, x_3 is a nurse. For all x_3, if x_3 takes a plane, then x_3 is poor. Can we infer the following from them? If we can, name the inference rule being used: For all x_3, x_3 will go running.
 From the fact that for all x_3, if x_3 takes a plane, then x_3 is poor, and that for all x_3, if x_3 were poor, then x_3 is running we can infer that for all x_3, if x_3 takes a plane, then x_3 is running via universal transitivity. From the fact that for all x_3, x_3 is a nurse we can infer that for all x_3, x_3 is a nurse or x_3 will take a plane via universal addition. Finally, from the fact that for all x_3, if x_3 were a nurse, then x_3 is running, that for all x_3, if x_3 takes a plane, then x_3 is running, and that for all x_3, x_3 is a nurse or x_3 will take a plane we can infer that for all x_3, x_3 will go running via universal disjunction elimination. Therefore, the answer is yes.