Translate the following inference to logic notation: For all x, if x_14 were a police officer, then x_14 is not making tea. For all x, x_14 will not cook or x_14 will read a book. For all x, x_14 will cook or x_14 will play tennis. For all x, x_14 will play tennis if and only if x_14 is a police officer. There is at least one x for which x_14 will make tea. Therefore there is at least one x for which x_14 will read a book.
forall x: P(x) -> ~Q(x). forall x: ~R(x) or S(x). forall x: R(x) or T(x). forall x: T(x) <-> P(x). exists x: Q(x). Therefore exists x: S(x).