Translate the following inference to logic notation: There is at least one x for which if x_17 were fast, then x_17 is bored. For all x, x_17 is fast if and only if x_17 is a taxi driver. For all x, x_17 is a soldier if and only if x_17 is bored. For all x, x_17 is not a soldier. Therefore there is at least one x for which x_17 is not a taxi driver.
exists x: P(x) -> Q(x). forall x: P(x) <-> R(x). forall x: S(x) <-> Q(x). forall x: ~S(x). Therefore exists x: ~R(x).