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