Preprint Open Access
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? We obtain a contradiction taking as assumption that P = NP. Therefore, we prove P is not equal to NP by reduction ad absurdum.