Translate the following inference to logic notation: For all x, x_11 will not go running or x_11 is a scientist. For all x, if x_11 were fast, then x_11 is running. For all x, x_11 is fast or x_11 will cook. There is at least one x for which if x_11 cooks, then x_11 is running. Therefore there is at least one x for which x_11 is a nurse or x_11 is a scientist.
forall x: ~P(x) or Q(x). forall x: R(x) -> P(x). forall x: R(x) or S(x). exists x: S(x) -> P(x). Therefore exists x: T(x) or Q(x).