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