Consider the following premises. For all x_11, if x_11 sleeps, then x_11 is a lawyer. For all x_11, x_11 will cook or x_11 is not a lawyer. There is at least one x_11 for which if x_11 were a mechanic, then x_11 is a sailor. For all x_11, if x_11 were a sailor, then x_11 is sleeping. Can we infer the following from them? There is at least one x_11 for which if x_11 were a mechanic, then x_11 is cooking.
 From the fact that for all x_11, x_11 will cook or x_11 is not a lawyer we can infer that for all x_11, if x_11 were a lawyer, then x_11 is cooking. From the fact that for all x_11, if x_11 were a sailor, then x_11 is sleeping, and that for all x_11, if x_11 sleeps, then x_11 is a lawyer we can infer that for all x_11, if x_11 were a sailor, then x_11 is a lawyer. From the fact that there is at least one x_11 for which if x_11 were a mechanic, then x_11 is a sailor, and that for all x_11, if x_11 were a sailor, then x_11 is a lawyer we can infer that there is at least one x_11 for which if x_11 were a mechanic, then x_11 is a lawyer. Finally, from the fact that there is at least one x_11 for which if x_11 were a mechanic, then x_11 is a lawyer, and that for all x_11, if x_11 were a lawyer, then x_11 is cooking we can infer that there is at least one x_11 for which if x_11 were a mechanic, then x_11 is cooking. Therefore, the answer is yes.