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: exists x_16: Q_16(x_16). forall x_16: P_14(x_16) -> T(x_16). forall x_16: T(x_16) or ~Q_16(x_16). forall x_16: T(x_16) -> P_14(x_16).
forall x_16: Q_16(x_16) -> T(x_16) can be inferred via the universal rewriting rule. forall x_16: P_14(x_16) <-> T(x_16) can be inferred via the universal biconditional introduction rule. forall x_16: T(x_16) <-> P_14(x_16) can be inferred via the universal biconditional introduction rule.