Translate the following inference to logic notation: For all x, x_2 will go running if and only if x_2 is an office clerk. There is at least one x for which x_2 is not a politician. For all x, if x_2 were an office clerk, then x_2 is a politician. Therefore there is at least one x for which x_2 will not go running.
forall x: P(x) <-> Q(x). exists x: ~R(x). forall x: Q(x) -> R(x). Therefore exists x: ~P(x).