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