Translate the following inference to logic notation: For all x, if x_11 plays tennis, then x_11 is taking a plane. For all x, if x_11 takes a plane, then x_11 is running. For all x, x_11 will take a plane or x_11 will not go running. There is at least one x for which x_11 will read a book or x_11 will go running. For all x, if x_11 reads a book, then x_11 is playing tennis. Therefore there is at least one x for which x_11 will take a plane.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: Q(x) or ~R(x). exists x: S(x) or R(x). forall x: S(x) -> P(x). Therefore exists x: Q(x).