Translate the following inference to logic notation: For all x, if z were curious, then z is sleeping. For all x, z is a politician. For all x, if z reads a book, then z is curious. For all x, if z reads a book, then z is not a politician. There is at least one x for which if z sleeps, then z is reading a book. Therefore there is at least one x for which z is not curious.
forall x: P(x) -> Q(x). forall x: R(x). forall x: S(x) -> P(x). forall x: S(x) -> ~R(x). exists x: Q(x) -> S(x). Therefore exists x: ~P(x).