Consider the following premises. For all x_17, if x_17 plays tennis, then x_17 is climbing a mountain. For all x_17, x_17 is a server or x_17 will go running. For all x_17, if x_17 climbs a mountain, then x_17 is not running. There is at least one x_17 for which x_17 is not a server. For all x_17, if x_17 were a taxi driver, then x_17 is playing tennis. Can we infer the following from them? There is at least one x_17 for which x_17 is not a taxi driver.
 From the fact that for all x_17, x_17 is a server or x_17 will go running, and that there is at least one x_17 for which x_17 is not a server we can infer that there is at least one x_17 for which x_17 will go running. From the fact that for all x_17, if x_17 were a taxi driver, then x_17 is playing tennis, and that for all x_17, if x_17 plays tennis, then x_17 is climbing a mountain we can infer that for all x_17, if x_17 were a taxi driver, then x_17 is climbing a mountain. From the fact that for all x_17, if x_17 climbs a mountain, then x_17 is not running, and that there is at least one x_17 for which x_17 will go running we can infer that there is at least one x_17 for which x_17 will not climb a mountain. Finally, from the fact that for all x_17, if x_17 were a taxi driver, then x_17 is climbing a mountain, and that there is at least one x_17 for which x_17 will not climb a mountain we can infer that there is at least one x_17 for which x_17 is not a taxi driver. Therefore, the answer is yes.