Translate the following inference to logic notation: For all x, if x_11 were an office clerk, then x_11 is running. For all x, x_11 will go running if and only if x_11 will work. For all x, x_11 is not a janitor or x_11 is a taxi driver. There is at least one x for which x_11 is a janitor or x_11 is an office clerk. For all x, if x_11 were a taxi driver, then x_11 is working. Therefore there is at least one x for which x_11 will go running.
forall x: P(x) -> Q(x). forall x: Q(x) <-> R(x). forall x: ~S(x) or T(x). exists x: S(x) or P(x). forall x: T(x) -> R(x). Therefore exists x: Q(x).