The true measure of success is how many times you can bounce back from failure.
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.