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