What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: For all x_5, x_5 is happy or x_5 will not cook. Joseph is not happy. For all x_5, if x_5 were happy, then x_5 is cooking.
For all x_5, if x_5 cooks, then x_5 is happy can be inferred via the universal rewriting rule.