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