Translate the following inference to logic notation: For all x, x_10 will climb a mountain if and only if x_10 is a sailor. For all x, if x_10 cooks, then x_10 is a taxi driver. For all x, if x_10 climbs a mountain, then x_10 is a taxi driver. For all x, x_10 will sleep or x_10 will cook. For all x, x_10 will not sleep or x_10 is a sailor. Therefore for all x, x_10 is a taxi driver.
forall x: P(x) <-> Q(x). forall x: R(x) -> S(x). forall x: P(x) -> S(x). forall x: T(x) or R(x). forall x: ~T(x) or Q(x). Therefore forall x: S(x).