NP-hard (non-deterministic polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP".
Note *at least*.
In any case, this does not affect main points in our earlier discussion.