Translate the following inference to logic notation: For all x, x_11 will not make tea. If it is cold, then Susan is sleeping. For all x, x_11 will make tea or x_11 will not sleep. Therefore it is not cold.
forall x: ~P(x). p -> Q(a). forall x: P(x) or ~Q(x). Therefore ~p.