I can solve some NP complete problems. Actually I did solve a few, meaning I used tools or wrote code that found optimal solutions. Recently, I used SAT solvers

I can solve some NP complete problems. Actually I did solve a few, meaning I used tools or wrote code that found optimal solutions. Recently, I used SAT solvers. NP-complete does not mean that any problem in this class is hard to solve, it's that the computational time of deterministic (non probabilistic) algorithms will grow fast (not polynomial).