Consider the following premises. For all x_2, if x_2 sleeps, then x_2 is taking a plane. There is at least one x_2 for which if x_2 takes a plane, then x_2 is bored. For all x_2, x_2 is not bored. Can we infer the following from them? There is at least one x_2 for which x_2 will not sleep.
 From the fact that for all x_2, if x_2 sleeps, then x_2 is taking a plane, and that there is at least one x_2 for which if x_2 takes a plane, then x_2 is bored we can infer that there is at least one x_2 for which if x_2 sleeps, then x_2 is bored. Finally, from the fact that there is at least one x_2 for which if x_2 sleeps, then x_2 is bored, and that for all x_2, x_2 is not bored we can infer that there is at least one x_2 for which x_2 will not sleep. Therefore, the answer is yes.