Consider the following premises. For all x_17, x_17 will work or x_17 will not go running. For all x_17, if x_17 works, then x_17 is taking a plane. For all x_17, if x_17 cooks, then x_17 is working. For all x_17, x_17 will not make tea or x_17 will cook. For all x_17, x_17 is rich or x_17 will make tea. There is at least one x_17 for which x_17 is not rich or x_17 will go running. Can we infer the following from them? For all x_17, x_17 will not take a plane.
 From the fact that for all x_17, x_17 will work or x_17 will not go running we can infer that for all x_17, if x_17 goes running, then x_17 is working. From the fact that for all x_17, x_17 is rich or x_17 will make tea, and that there is at least one x_17 for which x_17 is not rich or x_17 will go running we can infer that there is at least one x_17 for which x_17 will make tea or x_17 will go running. From the fact that there is at least one x_17 for which x_17 will make tea or x_17 will go running, and that for all x_17, x_17 will not make tea or x_17 will cook we can infer that there is at least one x_17 for which x_17 will go running or x_17 will cook. From the fact that for all x_17, if x_17 goes running, then x_17 is working, that for all x_17, if x_17 cooks, then x_17 is working, and that there is at least one x_17 for which x_17 will go running or x_17 will cook we can infer that there is at least one x_17 for which x_17 will work. Finally, from the fact that for all x_17, if x_17 works, then x_17 is taking a plane, and that there is at least one x_17 for which x_17 will work we can infer that there is at least one x_17 for which x_17 will take a plane, which contradicts that For all x_17, x_17 will not take a plane. Therefore, the answer is no.