Translate the following inference to logic notation: There is at least one x for which if x_17 were a poet, then x_17 is a nurse. For all x, x_17 is a poet if and only if x_17 will take a plane. For all x, x_17 will not go running. For all x, x_17 will go running if and only if x_17 is a nurse. Therefore there is at least one x for which x_17 will not take a plane.
exists x: P(x) -> Q(x). forall x: P(x) <-> R(x). forall x: ~S(x). forall x: S(x) <-> Q(x). Therefore exists x: ~R(x).