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