Translate the following inference to logic notation: For all x, if x_11 plays squash, then x_11 is running. For all x, x_11 is an electrician or x_11 will go running. For all x, x_11 is not an electrician or x_11 will cook. There is at least one x for which x_11 will not play squash. For all x, if x_11 goes running, then x_11 is playing squash. Therefore there is at least one x for which x_11 will cook.
forall x: P(x) -> Q(x). forall x: R(x) or Q(x). forall x: ~R(x) or S(x). exists x: ~P(x). forall x: Q(x) -> P(x). Therefore exists x: S(x).