Translate the following inference to logic notation: There is at least one x for which if x_11 were a politician, then x_11 is not bored. For all x, x_11 is bored. For all x, if x_11 were a sailor, then x_11 is a politician. For all x, if x_11 were a police officer, then x_11 is a sailor. Therefore there is at least one x for which x_11 is not a police officer.
exists x: P(x) -> ~Q(x). forall x: Q(x). forall x: R(x) -> P(x). forall x: S(x) -> R(x). Therefore exists x: ~S(x).