Translate the following inference to logic notation: For all x, x_11 will go running or x_11 will not read a book. For all x, x_11 will play tennis. For all x, if x_11 goes running, then x_11 is not playing tennis. For all x, if x_11 goes running, then x_11 is reading a book. Therefore for all x, x_11 will not read a book.
forall x: P(x) or ~Q(x). forall x: R(x). forall x: P(x) -> ~R(x). forall x: P(x) -> Q(x). Therefore forall x: ~Q(x).