Translate the following inference to logic notation: For all x, x_5 is not an office clerk or x_5 will work. For all x, x_5 will sleep if and only if x_5 will play a game. For all x, x_5 is an office clerk or x_5 will play a game. For all x, x_5 will not sleep. Therefore for all x, x_5 will work.
forall x: ~P(x) or Q(x). forall x: R(x) <-> S(x). forall x: P(x) or S(x). forall x: ~R(x). Therefore forall x: Q(x).