Translate the following inference to logic notation: For all x, x_12 will not read a book. For all x, if x_12 were a taxi driver, then x_12 is playing tennis. For all x, x_12 will read a book or x_12 is curious. For all x, x_12 is a taxi driver or x_12 will make tea. There is at least one x for which if x_12 makes tea, then x_12 is playing tennis. Therefore there is at least one x for which x_12 is curious and x_12 will play tennis.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: P(x) or S(x). forall x: Q(x) or T(x). exists x: T(x) -> R(x). Therefore exists x: S(x) and R(x).