Translate the following inference to logic notation: For all x, if x_14 were a taxi driver, then x_14 is sleeping. For all x, x_14 is fast. For all x, if x_14 cooks, then x_14 is sleeping. There is at least one x for which x_14 is a taxi driver or x_14 will cook. For all x, x_14 is sad. Therefore there is at least one x for which x_14 will sleep and x_14 is fast.
forall x: P(x) -> Q(x). forall x: R(x). forall x: S(x) -> Q(x). exists x: P(x) or S(x). forall x: T(x). Therefore exists x: Q(x) and R(x).