Translate the following inference to logic notation: For all x, x_6 will sleep if and only if x_6 will play tennis. For all x, if x_6 plays tennis, then x_6 is not a sailor. For all x, x_6 is a sailor. For all x, x_6 will sleep if and only if x_6 will go running. Therefore for all x, x_6 will not go running.
forall x: P(x) <-> Q(x). forall x: Q(x) -> ~R(x). forall x: R(x). forall x: P(x) <-> S(x). Therefore forall x: ~S(x).