Translate the following inference to logic notation: There is at least one x for which y will make tea if and only if y will climb a mountain. For all x, if y climbs a mountain, then y is a scientist. For all x, y will not make tea. For all x, if y were a scientist, then y is climbing a mountain. Therefore there is at least one x for which y is not a scientist.
exists x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: ~P(x). forall x: R(x) -> Q(x). Therefore exists x: ~R(x).