Consider the following premises. For all x_5, if x_5 works, then x_5 is sleeping. There is at least one x_5 for which if x_5 plays squash, then x_5 is sleeping. For all x_5, if x_5 sleeps, then x_5 is working. For all x_5, x_5 will not work. Can we infer the following from them? There is at least one x_5 for which x_5 will not play squash.
 From the fact that for all x_5, if x_5 works, then x_5 is sleeping, and that for all x_5, if x_5 sleeps, then x_5 is working we can infer that for all x_5, x_5 will work if and only if x_5 will sleep. From the fact that for all x_5, x_5 will work if and only if x_5 will sleep, and that for all x_5, x_5 will not work we can infer that for all x_5, x_5 will not sleep. Finally, from the fact that there is at least one x_5 for which if x_5 plays squash, then x_5 is sleeping, and that for all x_5, x_5 will not sleep we can infer that there is at least one x_5 for which x_5 will not play squash. Therefore, the answer is yes.