Translate the following inference to logic notation: For all x, x_16 will read a book or x_16 will work. For all x, if x_16 goes running, then x_16 is sleeping. There is at least one x for which x_16 will go running or x_16 will not work. For all x, x_16 will not read a book or x_16 is a politician. For all x, x_16 will sleep or x_16 is not a politician. Therefore there is at least one x for which x_16 will sleep.
forall x: P(x) or Q(x). forall x: R(x) -> S(x). exists x: R(x) or ~Q(x). forall x: ~P(x) or T(x). forall x: S(x) or ~T(x). Therefore exists x: S(x).