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_6, x_6 is bored if and only if x_6 will go running. For all x_6, x_6 is bored or x_6 will not make tea.
For all x_6, if x_6 makes tea, then x_6 is bored can be inferred via the universal rewriting rule. For all x_6, if x_6 were bored, then x_6 is running can be inferred via the universal biconditional elimination rule. For all x_6, if x_6 goes running, then x_6 is bored can be inferred via the universal biconditional elimination rule.