Translate the following inference to logic notation: For all x, z will play a game. There is at least one x for which if z were an astronaut, then z is not playing a game. Therefore there is at least one x for which z is not an astronaut.
forall x: P(x). exists x: Q(x) -> ~P(x). Therefore exists x: ~Q(x).