Translate the following inference to logic notation: For all x, x_11 will cook or x_11 will play a game. There is at least one x for which x_11 is a writer or x_11 is fast. For all x, x_11 is not a writer. For all x, x_11 will not cook. Therefore there is at least one x for which x_11 is fast and x_11 will play a game.
forall x: P(x) or Q(x). exists x: R(x) or S(x). forall x: ~R(x). forall x: ~P(x). Therefore exists x: S(x) and Q(x).