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