Translate the following inference to logic notation: There is at least one x for which if x_5 plays squash, then x_5 is not taking a plane. For all x, if x_5 were a soldier, then x_5 is taking a plane. For all x, if x_5 were a police officer, then x_5 is taking a plane. For all x, x_5 is a sailor or x_5 is a soldier. For all x, if x_5 were a sailor, then x_5 is a police officer. Therefore there is at least one x for which x_5 will not play squash.
exists x: P(x) -> ~Q(x). forall x: R(x) -> Q(x). forall x: S(x) -> Q(x). forall x: T(x) or R(x). forall x: T(x) -> S(x). Therefore exists x: ~P(x).