Translate the following inference to logic notation: For all x, if z were fast, then z is curious. For all x, if z were curious, then z is a writer. There is at least one x for which z is not a writer. Therefore there is at least one x for which z is not fast.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: ~R(x). Therefore exists x: ~P(x).