Question: why tsp is np hard?
Answer: The only known way to verify that a provided solution is the shortest possible solution is to actually solve TSP. Since it takes exponential time to solve NP, the solution cannot be checked in polynomial time. Thus this problem is NP-hard, but not in NP.