Translate the following inference to logic notation: For all x, if x_13 were an astronaut, then x_13 is reading a book. For all x, x_13 will play tennis or x_13 is a server. For all x, x_13 will climb a mountain or x_13 is an astronaut. For all x, if x_13 climbs a mountain, then x_13 is reading a book. There is at least one x for which x_13 will not play tennis. Therefore there is at least one x for which x_13 will read a book and x_13 is a server.
forall x: P(x) -> Q(x). forall x: R(x) or S(x). forall x: T(x) or P(x). forall x: T(x) -> Q(x). exists x: ~R(x). Therefore exists x: Q(x) and S(x).