A Formal Refutation of the P = NP Conjecture: Structural Barriers in NP-Complete Problems

This article proposes a formal refutation of the P = NP conjecture by demonstrating that certain NP-complete problems, classified as NP_structural, exhibit intrinsic structural barriers, grounded in informational limits such as those of Shannon and Kolmogorov, that render them intractable in polynomial time. The primary contribution lies in showing that, even if problems like SAT or TSP were solvable in polynomial time, this would not imply that all problems in NP belong to P. Thus, the work concludes that P ≠ NP, by highlighting that the equivalence among NP-complete problems is superficial. The article also provides concrete examples of problems in this category, such as TerraMassi, ERAP, and LRTP.