Translate the following inference to logic notation: For all x, if x_8 goes running, then x_8 is sleeping. There is at least one x for which if x_8 drinks water, then x_8 is sleeping. For all x, if x_8 were a server, then x_8 is not sleeping. For all x, x_8 will go running or x_8 will drink water. Therefore there is at least one x for which x_8 is not a server.
forall x: P(x) -> Q(x). exists x: R(x) -> Q(x). forall x: S(x) -> ~Q(x). forall x: P(x) or R(x). Therefore exists x: ~S(x).