Is the Satisfiability Problem (SAT) known to be NP-complete, or only conjectured to be NP-complete?
Answer. SAT is known to be NP-complete. That is the Cook/Levin theorem.