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