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