Translate the following inference to logic notation: Linda is driving a car. For all x, y_4 will not drive a car or y_4 is bored. For all x, y_4 is not curious or y_4 will drink water. Therefore there is at least one x for which y_4 is bored or y_4 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).