Translate the following inference to logic notation: For all x, if x_11 cooks, then x_11 is not a mechanic. For all x, x_11 will drive a car or x_11 is an astronaut. There is at least one x for which if x_11 were an astronaut, then x_11 is a mechanic. For all x, x_11 is a mechanic or x_11 will not drive a car. Therefore there is at least one x for which x_11 will not cook.
forall x: P(x) -> ~Q(x). forall x: R(x) or S(x). exists x: S(x) -> Q(x). forall x: Q(x) or ~R(x). Therefore exists x: ~P(x).