Translate the following inference to logic notation: Joseph is fast. For all x, x_7 is not fast or x_7 will sleep. For all x, x_7 will not read a book or x_7 will drink water. Therefore there is at least one x for which x_7 will sleep or x_7 will drink water.
P(a). forall x: ~P(x) or Q(x). forall x: ~R(x) or S(x). Therefore exists x: Q(x) or S(x).