P$\ne $NP Millenium-Problem(MP) TRIVIAL Physics Proof Via NATURAL TRUMPS Artificial-``Intelligence'' Via: Euclid Geometry, Plato Forms, Aristotle Square-of-Opposition, Menger Dimension-Theory Connections!!! NO Computational-Complexity(CC)/ANYthing!!!: Geometry!!!

P $\ne $NP MP proof is by computer-"science"/SEANCE(!!!)(CS) computational-"intelligence" lingo jargonial-obfuscation(JO) NATURAL-Intelligence(NI) DISambiguation! CS P$=$(?)$=$NP MEANS (Deterministic)\textbullet (PC)$=$ (?)$=$(Non-D)\textbullet (PC) i.e. D\textbullet (P)$=$(?)$=$ N\textbullet (P). For inclusion(equality) vs. exclusion (inequality) irrelevant (P) simply cancels!!! (Equally any/all other CCs IF both sides identical). Crucial question left: (D)$=$(?)$=$(ND), i.e. D $=$(?)$=$ N. Algorithmics[Sipser[Intro. Thy.Comp.(`97)-p.49;Fig.1.15!!!]]: Deterministic (D) serial VS. Non-deterministic (N) NON-serial, branch fork forms triangles, its vertices a plane. Menger Dimension-Theory: Dimensionality: D serial is dim(D)$=$1(definition), VS. N non-serial is dim(N)$=$[2(branching;fork;triangle;plane)$+$E(probabilistic)]\textgreater 2(\textgreater \textgreater \textgreater )$\ne $1! Hence by (Euclid[\textasciitilde -300 BCE]) simple geometry, dim(D)$=$1 $\ne $dim(N)\textgreater 2, Left-to-Right INclusion VS. Right-to-Left EXclusion. Thus TRIVIALLY P $\ne $ NP!!! QED FIN, i.e. D$\ne $N by \textasciitilde -300 BCE GEOMETRY, just ``a tad'' before CS CC JO!!! Harder proofs, but still amenable to NI analysis, are any combinations with DISsimilar CCs, especially LHS combining D with low CC and/or RHS combining N with different CCs: EXP and/or LOG! MUCH HARDER but still amenable to CC NI are: CROSS-MIXTURES: P$=$(?)$=$N\textbullet LOG, EXP$=$(?)$=$N\textbullet P, EXP$=$(?)$=$N\textbullet LOG,...