Translate the following inference to logic notation: For all x, x_7 will not read a book. For all x, if x_7 were a police officer, then x_7 is drinking water. For all x, if x_7 drinks water, then x_7 is reading a book. There is at least one x for which if x_7 drinks water, then x_7 is taking a plane. For all x, if x_7 takes a plane, then x_7 is a police officer. Therefore there is at least one x for which x_7 will not take a plane.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). exists x: R(x) -> S(x). forall x: S(x) -> Q(x). Therefore exists x: ~S(x).