Algorithm for Solving SAT in O(n)

This is a novel algorithm that solves SAT in $O(n)$. The approach is as follows: first, reduce any SAT instance (e.g., 3-SAT) to 2-SAT, then solve it using Tarjan's algorithm. The parsing is performed using binary search. The reduction is done correctly.