Consider the following premises. There is at least one x_10 for which if x_10 goes running, then x_10 is playing tennis. For all x_10, x_10 will not play tennis. For all x_10, if x_10 plays tennis, then x_10 is running. For all x_10, if x_10 plays a game, then x_10 is running. Can we infer the following from them? There is at least one x_10 for which x_10 will not play a game.
 From the fact that for all x_10, if x_10 plays tennis, then x_10 is running, and that there is at least one x_10 for which if x_10 goes running, then x_10 is playing tennis we can infer that there is at least one x_10 for which x_10 will play tennis if and only if x_10 will go running. From the fact that there is at least one x_10 for which x_10 will play tennis if and only if x_10 will go running, and that for all x_10, x_10 will not play tennis we can infer that there is at least one x_10 for which x_10 will not go running. Finally, from the fact that for all x_10, if x_10 plays a game, then x_10 is running, and that there is at least one x_10 for which x_10 will not go running we can infer that there is at least one x_10 for which x_10 will not play a game. Therefore, the answer is yes.