Question: can tsp be verified in polynomial time?
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.