Translate the following inference to logic notation: There is at least one x for which x_10 will not read a book. For all x, if x_10 were a lawyer, then x_10 is a janitor. For all x, if x_10 reads a book, then x_10 is a janitor. For all x, if x_10 were a janitor, then x_10 is a lawyer. For all x, if x_10 were a janitor, then x_10 is reading a book. Therefore there is at least one x for which x_10 is not a lawyer.
exists x: ~P(x). forall x: Q(x) -> R(x). forall x: P(x) -> R(x). forall x: R(x) -> Q(x). forall x: R(x) -> P(x). Therefore exists x: ~Q(x).