Translate the following inference to logic notation: For all x, if x_11 sleeps, then x_11 is cooking. There is at least one x for which if x_11 cooks, then x_11 is sleeping. For all x, x_11 will sleep or x_11 will not play squash. Therefore there is at least one x for which if x_11 plays squash, then x_11 is cooking.
forall x: P(x) -> Q(x). exists x: Q(x) -> P(x). forall x: P(x) or ~R(x). Therefore exists x: R(x) -> Q(x).