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