Translate the following inference to logic notation: For all x, if z works, then z is making tea. For all x, if z makes tea, then z is curious. Karen is not working. For all x, if z plays a game, then z is working. For all x, if z were curious, then z is playing a game. Therefore Karen is not curious.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). ~P(a). forall x: S(x) -> P(x). forall x: R(x) -> S(x). Therefore ~R(a).