Here's why I think this polynomial time SAT solver concept is correct

Algorithm concept

I've been working on a polynomial-time SAT solver concept for over a year. Here are the reasons why I think this concept is correct:

1. Doesn't use the resolution rule (which is proven to be exponential).
2. Directly solves the forgetting problem of DPLL.
3. Uses Conflict Tree to prevent re-exploring conflicting branches.