Translate the following inference to logic notation: For all x, x_2 will sleep or x_2 will drive a car. For all x, if x_2 sleeps, then x_2 is a doctor. For all x, if x_2 drives a car, then x_2 is climbing a mountain. For all x, if x_2 climbs a mountain, then x_2 is a doctor. Therefore for all x, x_2 is a doctor or x_2 is curious.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: Q(x) -> S(x). forall x: S(x) -> R(x). Therefore forall x: R(x) or T(x).