Translate the following inference to logic notation: For all x, if x_15 were an astronaut, then x_15 is not fast. For all x, x_15 is a police officer. There is at least one x for which if x_15 drinks water, then x_15 is a server. For all x, if x_15 were a server, then x_15 is fast. For all x, if x_15 were a police officer, then x_15 is drinking water. Therefore there is at least one x for which x_15 is not an astronaut.
forall x: P(x) -> ~Q(x). forall x: R(x). exists x: S(x) -> T(x). forall x: T(x) -> Q(x). forall x: R(x) -> S(x). Therefore exists x: ~P(x).