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