Translate the following inference to logic notation: For all x, if x_9 climbs a mountain, then x_9 is excited. For all x, if x_9 were a server, then x_9 is excited. For all x, x_9 is happy or x_9 will climb a mountain. For all x, x_9 is an astronaut. For all x, x_9 is not happy or x_9 is a server. Therefore Linda is excited.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x) or P(x). forall x: T(x). forall x: ~S(x) or R(x). Therefore Q(a).