Translate the following inference to logic notation: For all x, if x_13 takes a plane, then x_13 is playing squash. For all x, x_13 will drink water or x_13 will take a plane. For all x, if x_13 drinks water, then x_13 is playing squash. James is working. Therefore there is at least one x for which x_13 will work and x_13 will play squash.
forall x: P(x) -> Q(x). forall x: R(x) or P(x). forall x: R(x) -> Q(x). S(a). Therefore exists x: S(x) and Q(x).