Translate the following inference to logic notation: For all x, x_3 will write a letter or x_3 will read a book. For all x, x_3 will not read a book or x_3 will sleep. There is at least one x for which x_3 will not write a letter or x_3 will go running. Therefore there is at least one x for which x_3 will go running or x_3 will sleep.
forall x: P(x) or Q(x). forall x: ~Q(x) or R(x). exists x: ~P(x) or S(x). Therefore exists x: S(x) or R(x).