Translate the following inference to logic notation: There is at least one x for which if x_7 were a bartender, then x_7 is sleeping. For all x, if x_7 sleeps, then x_7 is not making tea. For all x, if x_7 plays squash, then x_7 is a bartender. For all x, x_7 will make tea. Therefore there is at least one x for which x_7 will not play squash.
exists x: P(x) -> Q(x). forall x: Q(x) -> ~R(x). forall x: S(x) -> P(x). forall x: R(x). Therefore exists x: ~S(x).