Translate the following inference to logic notation: For all x, x_10 is a bartender or x_10 is not happy. For all x, x_10 will not drive a car. For all x, if x_10 were a bartender, then x_10 is cooking. For all x, x_10 will drive a car or x_10 is happy. Therefore for all x, x_10 will cook.
forall x: P(x) or ~Q(x). forall x: ~R(x). forall x: P(x) -> S(x). forall x: R(x) or Q(x). Therefore forall x: S(x).