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