Translate the following inference to logic notation: For all x, if x_11 works, then x_11 is a taxi driver. For all x, x_11 will work or x_11 will climb a mountain. For all x, x_11 is not a taxi driver. There is at least one x for which if x_11 climbs a mountain, then x_11 is a taxi driver. Therefore there is at least one x for which x_11 is a server.
forall x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: ~Q(x). exists x: R(x) -> Q(x). Therefore exists x: S(x).