Translate the following inference to logic notation: For all x, x is excited. For all x, if x were a writer, then x is not excited. Therefore for all x, x is not a writer.
forall x: P(x). forall x: Q(x) -> ~P(x). Therefore forall x: ~Q(x).