Translate the following inference to logic notation: For all x, x_11 is not a carpenter. For all x, x_11 is a carpenter or x_11 is an artist. For all x, if x_11 reads a book, then x_11 is playing squash. There is at least one x for which x_11 will read a book. Therefore there is at least one x for which x_11 will play squash and x_11 is an artist.
forall x: ~P(x). forall x: P(x) or Q(x). forall x: R(x) -> S(x). exists x: R(x). Therefore exists x: S(x) and Q(x).