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