Translate the following inference to logic notation: There is at least one x for which if x_16 were a poet, then x_16 is a janitor. For all x, x_16 is a janitor if and only if x_16 will sleep. For all x, x_16 will not sleep. For all x, if x_16 were a musician, then x_16 is a poet. For all x, if x_16 reads a book, then x_16 is a musician. Therefore there is at least one x for which x_16 will not read a book.
exists x: P(x) -> Q(x). forall x: Q(x) <-> R(x). forall x: ~R(x). forall x: S(x) -> P(x). forall x: T(x) -> S(x). Therefore exists x: ~T(x).