Translate the following inference to logic notation: For all x, x_10 will cook. There is at least one x for which if x_10 reads a book, then x_10 is driving a car. For all x, x_10 will climb a mountain. For all x, if x_10 climbs a mountain, then x_10 is reading a book. Therefore there is at least one x for which x_10 will drive a car and x_10 will cook.
forall x: P(x). exists x: Q(x) -> R(x). forall x: S(x). forall x: S(x) -> Q(x). Therefore exists x: R(x) and P(x).