Translate the following inference to logic notation: For all x, x_11 will listen to a song or x_11 is not poor. There is at least one x for which x_11 is not a mechanic. For all x, if x_11 listens to a song, then x_11 is poor. For all x, if x_11 listens to a song, then x_11 is a mechanic. Therefore there is at least one x for which x_11 is not poor.
forall x: P(x) or ~Q(x). exists x: ~R(x). forall x: P(x) -> Q(x). forall x: P(x) -> R(x). Therefore exists x: ~Q(x).