Translate the following inference to logic notation: For all x, x_14 will read a book and x_14 will make tea. There is at least one x for which x_14 is a lawyer. For all x, if x_14 plays squash, then x_14 is not reading a book. Therefore there is at least one x for which x_14 will not play squash.
forall x: P(x) and Q(x). exists x: R(x). forall x: S(x) -> ~P(x). Therefore exists x: ~S(x).