Translate the following inference to logic notation: For all x, x_23 will not read a book. For all x, x_23 will take a plane if and only if x_23 will sleep. For all x, if x_23 plays tennis, then x_23 is sleeping. For all x, x_23 will take a plane if and only if x_23 is a scientist. There is at least one x for which x_23 is a scientist if and only if x_23 will read a book. Therefore there is at least one x for which x_23 will not play tennis.
forall x: ~P(x). forall x: Q(x) <-> R(x). forall x: S(x) -> R(x). forall x: Q(x) <-> T(x). exists x: T(x) <-> P(x). Therefore exists x: ~S(x).