Translate the following inference to logic notation: For all x, x_11 will read a book or x_11 is a nurse. For all x, x_11 is a nurse if and only if x_11 is curious. For all x, x_11 will read a book if and only if x_11 is curious. There is at least one x for which if x_11 works, then x_11 is not curious. Therefore there is at least one x for which x_11 will not work.
forall x: P(x) or Q(x). forall x: Q(x) <-> R(x). forall x: P(x) <-> R(x). exists x: S(x) -> ~R(x). Therefore exists x: ~S(x).