Let SAT be the set of all satisfiable boolean formulae.
Can there exists an algorithm A which can actually computes a satisfying assignment for a boolean formula of size n using only $O(\log n)$ SAT oracle queries? Prove or disprove.
You can assume that NP $\neq $ P in your proof.