Translate the following inference to logic notation: For all x, if x_7 plays squash, then x_7 is excited. For all x, if x_7 were excited, then x_7 is a sailor. For all x, x_7 will not drive a car. For all x, x_7 will drive a car if and only if x_7 is a sailor. Therefore for all x, x_7 will not play squash.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: ~S(x). forall x: S(x) <-> R(x). Therefore forall x: ~P(x).