Here's a constructive proof that P = NP and the Integer Factorization Problem is NP-Complete.
RZN AI 3SAT De-Exponentializer and RZN AI 3SAT Solver Enhancement
US patents pending: #63/715,594 and #63/752,030
This is the reference implementation for the efficient 3SAT logic solver described in the two above patents.
I made use of Satlib: Holger H. Hoos and Thomas Stützle: SATLIB: An Online Resource for Research on SAT. In: I.P.Gent, H.v.Maaren, T.Walsh, editors, SAT 2000, pp.283-292, IOS Press, 2000. SATLIB is available online at www.satlib.org.