Translate the following inference to logic notation: For all x, if x_7 sleeps, then x_7 is taking a plane. For all x, if x_7 drinks water, then x_7 is sleeping. For all x, x_7 is not a server. There is at least one x for which if x_7 takes a plane, then x_7 is a server. Therefore there is at least one x for which x_7 will not drink water.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: ~S(x). exists x: Q(x) -> S(x). Therefore exists x: ~R(x).