Translate the following inference to logic notation: For all x, x_6 is not a mechanic or x_6 will listen to a song. For all x, if x_6 goes running, then x_6 is not drinking water. There is at least one x for which x_6 is a mechanic or x_6 will go running. For all x, x_6 will drink water. Therefore there is at least one x for which x_6 will listen to a song.
forall x: ~P(x) or Q(x). forall x: R(x) -> ~S(x). exists x: P(x) or R(x). forall x: S(x). Therefore exists x: Q(x).