Translate the following inference to logic notation: For all x, x_14 is excited if and only if x_14 is a sailor. For all x, x_14 is not curious or x_14 will go running. For all x, if x_14 were a sailor, then x_14 is not sleeping. There is at least one x for which x_14 will sleep. For all x, x_14 is curious or x_14 is excited. Therefore there is at least one x for which x_14 will go running.
forall x: P(x) <-> Q(x). forall x: ~R(x) or S(x). forall x: Q(x) -> ~T(x). exists x: T(x). forall x: R(x) or P(x). Therefore exists x: S(x).