Translate the following inference to logic notation: There is at least one x for which if x_6 were a cashier, then x_6 is climbing a mountain. For all x, if x_6 climbs a mountain, then x_6 is a soldier. For all x, if x_6 plays squash, then x_6 is a cashier. For all x, if x_6 were a soldier, then x_6 is drinking water. Therefore there is at least one x for which if x_6 plays squash, then x_6 is drinking water.
exists x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) -> P(x). forall x: R(x) -> T(x). Therefore exists x: S(x) -> T(x).