Consider the following premises. For all x_11, x_11 will drink water or x_11 will not go running. For all x_11, x_11 is not a janitor or x_11 will play squash. For all x_11, x_11 is a janitor or x_11 will listen to a song. For all x_11, if x_11 listens to a song, then x_11 is making tea. For all x_11, if x_11 makes tea, then x_11 is running. For all x_11, if x_11 plays squash, then x_11 is running. Can we infer the following from them? If we can, name the inference rule being used: For all x_11, x_11 will drink water.
 From the fact that for all x_11, if x_11 listens to a song, then x_11 is making tea, and that for all x_11, if x_11 makes tea, then x_11 is running we can infer that for all x_11, if x_11 listens to a song, then x_11 is running via universal transitivity. From the fact that for all x_11, x_11 is a janitor or x_11 will listen to a song, and that for all x_11, x_11 is not a janitor or x_11 will play squash we can infer that for all x_11, x_11 will listen to a song or x_11 will play squash via universal resolution. From the fact that for all x_11, x_11 will drink water or x_11 will not go running we can infer that for all x_11, if x_11 goes running, then x_11 is drinking water via universal rewriting. From the fact that for all x_11, if x_11 listens to a song, then x_11 is running, that for all x_11, if x_11 plays squash, then x_11 is running, and that for all x_11, x_11 will listen to a song or x_11 will play squash we can infer that for all x_11, x_11 will go running via universal disjunction elimination. Finally, from the fact that for all x_11, if x_11 goes running, then x_11 is drinking water, and that for all x_11, x_11 will go running we can infer that for all x_11, x_11 will drink water via universal modus ponens. Therefore, the answer is yes.