Method of resolution of 3SAT in polynomial time

TL;DR

This paper claims a polynomial-time method for solving 3SAT, suggesting P=NP, by presenting a new resolution technique that can determine and find solutions efficiently.

Contribution

It introduces a novel polynomial-time method for solving 3SAT and proves that 3SAT is in P, implying P=NP, which is a major theoretical breakthrough.

Findings

3SAT can be solved in polynomial time using the proposed method

The method can find solutions if they exist within polynomial time

Supports the P=NP claim through the resolution technique

Abstract

Presentation of a Method for determining whether a problem 3Sat has solution, and if yes to find one, in time max O(n^15). Is thus proved that the problem 3Sat is fully resolved in polynomial time and therefore that it is in P, by the work of Cook and Levin, and can transform a SAT problem in a 3Sat in polynomial time (ref. Karp), it follows that P = NP. Open Source program is available at http://www.visainformatica.it/3sat