If a problem is NP-Hard, it does not mean it cannot be solved. Rather, it means it cannot be solved efficiently (in <i>polynomial</i> time). Most NPH problems, now including Mario and 3SAT, can be solved given the time and compute resources to do so.