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