Translate the following inference to logic notation: For all x, x_5 will sleep or x_5 will not write a letter. For all x, if x_5 plays a game, then x_5 is sleeping. For all x, x_5 will write a letter. Therefore for all x, x_5 will sleep.
forall x: P(x) or ~Q(x). forall x: R(x) -> P(x). forall x: Q(x). Therefore forall x: P(x).