Translate the following inference to logic notation: For all x, x_6 is not sad or x_6 will go running. For all x, x_6 will not listen to a song. For all x, x_6 will listen to a song if and only if x_6 will drive a car. There is at least one x for which x_6 is sad or x_6 will drive a car. Therefore there is at least one x for which x_6 will go running.
forall x: ~P(x) or Q(x). forall x: ~R(x). forall x: R(x) <-> S(x). exists x: P(x) or S(x). Therefore exists x: Q(x).