Consider the following premises. For all x_11, if x_11 were fast, then x_11 is not cooking. There is at least one x_11 for which if x_11 were a bartender, then x_11 is poor. For all x_11, if x_11 goes running, then x_11 is fast. For all x_11, x_11 will cook. For all x_11, if x_11 were poor, then x_11 is running. Can we infer the following from them? There is at least one x_11 for which x_11 is not a bartender.
 From the fact that for all x_11, if x_11 were fast, then x_11 is not cooking, and that for all x_11, x_11 will cook we can infer that for all x_11, x_11 is not fast. From the fact that for all x_11, if x_11 were poor, then x_11 is running, and that for all x_11, if x_11 goes running, then x_11 is fast we can infer that for all x_11, if x_11 were poor, then x_11 is fast. From the fact that there is at least one x_11 for which if x_11 were a bartender, then x_11 is poor, and that for all x_11, if x_11 were poor, then x_11 is fast we can infer that there is at least one x_11 for which if x_11 were a bartender, then x_11 is fast. Finally, from the fact that there is at least one x_11 for which if x_11 were a bartender, then x_11 is fast, and that for all x_11, x_11 is not fast we can infer that there is at least one x_11 for which x_11 is not a bartender. Therefore, the answer is yes.