In his blog post on the Eight Signs A Claimed P $\neq$ NP Proof Is Wrong”, Scott Aaronson indicates in his first test that the proof fails to distinguish 2-SAT and other elementary problems known to be in P.
Question: Is there any complexity measure whatsoever, not just time complexity, that can distinguish 2-SAT from Clique, for example?