Translate the following inference to logic notation: For all x, x_13 is not a poet. For all x, if x_13 were fast, then x_13 is cooking. There is at least one x for which x_13 is a poet or x_13 is fast. Therefore there is at least one x for which x_13 will cook or x_13 is a taxi driver.
forall x: ~P(x). forall x: Q(x) -> R(x). exists x: P(x) or Q(x). Therefore exists x: R(x) or S(x).