Translate the following inference to logic notation: For all x, z will not go running. For all x, if z were an office clerk, then z is running. If David plays tennis, then James is an office clerk. If James were an office clerk, then David is playing tennis. Therefore David is not playing tennis.
forall x: ~P(x). forall x: Q(x) -> P(x). p -> Q(a). Q(a) -> p. Therefore ~p.