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