3-SAT is the version of Boolean satisfiability where clauses are in 3-CNF, which is definitely NP-complete. Hence the problem isn't actually *solving* a SAT instance as jestingly implied by the original tweet, but doing so in polytime (