Translate the following inference to logic notation: For all x, x_3 will not sleep. For all x, x_3 will sleep or x_3 is not a server. There is at least one x for which if x_3 were a server, then x_3 is sleeping. For all x, if x_3 sleeps, then x_3 is a server. Therefore there is at least one x for which x_3 is not a server.
forall x: ~P(x). forall x: P(x) or ~Q(x). exists x: Q(x) -> P(x). forall x: P(x) -> Q(x). Therefore exists x: ~Q(x).