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