Translate the following inference to logic notation: For all x, if x_11 were happy, then x_11 is a nurse. For all x, x_11 is happy or x_11 is an artist. For all x, if x_11 were an artist, then x_11 is a scientist. There is at least one x for which if x_11 were a scientist, then x_11 is a nurse. Therefore there is at least one x for which x_11 is a nurse or x_11 will climb a mountain.
forall x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: R(x) -> S(x). exists x: S(x) -> Q(x). Therefore exists x: Q(x) or T(x).