Translate the following inference to logic notation: For all x, if y_4 were fast, then y_4 is drinking water. There is at least one x for which y_4 will not play a game or y_4 will cook. For all x, y_4 will not drink water. For all x, y_4 will play a game or y_4 is fast. For all x, if y_4 drinks water, then y_4 is fast. Therefore there is at least one x for which y_4 will cook.
forall x: P(x) -> Q(x). exists x: ~R(x) or S(x). forall x: ~Q(x). forall x: R(x) or P(x). forall x: Q(x) -> P(x). Therefore exists x: S(x).