We investigate the complexity of SAT(⋅) with partial clone theory.
We identify the computationally easiest NP-complete SAT(⋅) problem.
We study the time complexity of this problem and relate it to 1-in-3-SAT.
We relate the easiest SAT(⋅) problem to the exponential-time hypothesis.