Translate the following inference to logic notation: There is at least one x for which x_11 will listen to a song. For all x, if x_11 listens to a song, then x_11 is working. For all x, x_11 is an electrician if and only if x_11 will play tennis. For all x, if x_11 were an electrician, then x_11 is not working. Therefore there is at least one x for which x_11 will not play tennis.
exists x: P(x). forall x: P(x) -> Q(x). forall x: R(x) <-> S(x). forall x: R(x) -> ~Q(x). Therefore exists x: ~S(x).