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