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