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