Translate the following inference to logic notation: For all x, if x_12 works, then x_12 is a sailor. For all x, if x_12 were curious, then x_12 is working. There is at least one x for which x_12 will work or x_12 is not a scientist. For all x, if x_12 were a sailor, then x_12 is curious. For all x, x_12 is not a sailor. Therefore there is at least one x for which x_12 is not a scientist.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). exists x: P(x) or ~S(x). forall x: Q(x) -> R(x). forall x: ~Q(x). Therefore exists x: ~S(x).