Translate the following inference to logic notation: For all x, x_11 will not play tennis or x_11 is a taxi driver. For all x, if x_11 were a taxi driver, then x_11 is cooking. There is at least one x for which x_11 will play tennis or x_11 will read a book. For all x, if x_11 reads a book, then x_11 is cooking. Therefore there is at least one x for which x_11 will cook or x_11 will listen to a song.
forall x: ~P(x) or Q(x). forall x: Q(x) -> R(x). exists x: P(x) or S(x). forall x: S(x) -> R(x). Therefore exists x: R(x) or T(x).