P versus NP

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We consider the following problem: Given a 2CNF formula and a natural number k, is it possible to remove at most k clauses so that the resulting 2CNF formula is satisfiable? This problem is NP-complete. We prove this problem can always be solved in polynomial time. In this way, we demonstrate the complexity class P is equal to NP.