Membership from the library's definition of unbounded acceptance with value invention; hardness because finite satisfiability, recursively enumerable on concrete instances, reduces to the halting problem by the library's ordered reduction, the machine bridge, and is RE-hard by this submission's statement.