Translate the following inference to logic notation: There is at least one x for which x_5 will play tennis if and only if x_5 will go running. For all x, x_5 will not play tennis. For all x, x_5 will go running if and only if x_5 will play squash. Therefore there is at least one x for which x_5 will not play squash.
exists x: P(x) <-> Q(x). forall x: ~P(x). forall x: Q(x) <-> R(x). Therefore exists x: ~R(x).