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