Translate the following inference to logic notation: For all x, if x_13 drinks water, then x_13 is a janitor. For all x, if x_13 were a janitor, then x_13 is a scientist. For all x, if x_13 were a scientist, then x_13 is a janitor. For all x, x_13 will play squash if and only if x_13 will drink water. There is at least one x for which x_13 will take a plane if and only if x_13 will play squash. For all x, x_13 is not a scientist. Therefore there is at least one x for which x_13 will not take a plane.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> Q(x). forall x: S(x) <-> P(x). exists x: T(x) <-> S(x). forall x: ~R(x). Therefore exists x: ~T(x).