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