NP-hard is not a subset of NP, so its problems are

• not necessarily decision problems
• not necessarily verifiable in polynomial time.