Determine complexity of a SAT problem
No, there is not.

Your question is not well-posed.  You have not specified whether you want worst-case complexity or average-case complexity, and over what class of SAT instances.  The answer will depend heavily upon those details.

If you want to know what is the world record for an algorithm for 3SAT, measured by its worst-case complexity over all possible 3SAT instances, that's a question to ask on https://cs.stackexchange.com/ or https://cstheory.stackexchange.com/ .  See, e.g., Best Upper Bounds on SAT and Measuring the difficulty of SAT instances.  But don't expect these theoretical results to necessarily have any relationship to the performance of SAT solvers in practice.