ujin算法：SAT的确定的多项式算法

We discover a new object in the nature --- Aujin. Based on Aujin, we prove several important theorems, and build this deterministic polynomial algorithm for SAT(the NP-complete satisfiability problem). We also propose three conjectures such that the proof of any one of them will lead to the proof that P=NP. Millions of CNFs (conjunctive normal form) have been tested, and there is no counter-example. And thus experts in computational complexity may abandon the old mind --- NP≠P. Moreover, even if all these three conjectures were incorrect, Aujin Algorithm still is a deterministic polynomial algorithm in any case, and can be used to handle practical problems.