Super-linear time complexity lower bounds for any natural problem in NP? Do we know any problem in NP which has a super-linear time complexity lower bound? Ideally, we would like to show that 3SAT has super-polynomial lower bounds, but I guess we're far away from that. I'd just like to know any examples of super-linear lower bounds.
I know that the time hierarchy theorem gives us problems which can be solved in O(n^3) but not in O(n^2), etc. Thus I put the word "natural" in the question.
I ask for problems in NP, because otherwise someone would give examples of EXP-complete problems. 
I know there are time-space tradeoffs for some problems in NP. I don't know if any of them imply a super-linear time complexity lower bound though.
(To address a question below about machine models, consider either multitape Turing machines or the RAM model.)
 A: For the circuit model, the answer is NO. The best general lower bounds are linear.
(As Ryan explained in his answer and comment for multi tape Turing machines there are (slightly) superlinear bounds. As far as I understand from his comment for random access Turing machines there are no superlinear lower bounds known.)  
A: If you restrict space usage to be sublinear then you can prove superlinear time lower bounds on SAT.  See this article on Lipton's blog for a nice exposition.
A: Sorry I am so late to the discussion, but I just registered...
There are non-linear time lower bounds on multitape Turing machines for NP-complete problems. These lower bounds follow from the fact that the class of problems solvable in nondeterministic linear time is not equal to the class of those solvable in (deterministic) linear time, in the multitape Turing machine setting. This is proved in:

Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter: On Determinism versus Non-Determinism and Related Problems (Preliminary Version) FOCS 1983: 429-438

In fact, unraveling the proof shows that there must be some problem solvable in nondeterministic linear time that is not solvable in $o(n \cdot (\log^* n)^{1/4})$ time (again, on a multitape Turing machine). Note the * in the logarithm; this is just "barely" above linear. One known application of this result is that a natural NP-complete problem in automata theory cannot be solved in $o(n \cdot (\log^* n)^{1/4})$ time:

Etienne Grandjean: A Nontrivial Lower Bound for an NP Problem on Automata. SIAM J. Comput. 19(3): 438-451 (1990)

Unfortunately the lower bound of Paul et al. relies crucially on the geometry that arises from accessing one-dimensional tapes. We don't know how to prove a non-linear lower bound even if you allow the Turing machine to have a constant number of two-dimensional tapes. We can prove time lower bounds for NP problems on general computational models if you severely restrict the extra workspace used by the machine. (This is getting into my own work so I won't say more unless you're truly interested.)
As for the comment above me: the sorting lower bound holds only in a comparison-based model, which is extremely restricted. The claim that sorting requires Omega(n log n) time on general computational models is false. There are faster algorithms for sorting integers. See for example:

Yijie Han: Deterministic sorting in O(n log logn) time and linear space. J. Algorithms 50(1): 96-105 (2004) 

A: Running time depends on the model of computation.  For example, the problem "Given strings $s$ and $t$, are they identical?" takes quadratic time on a one-tape Turing machine.  So you can give a more reasonable model of computation... and the next person to come along will explain how it is much too strong, etc.
Hmmm. Perhaps your question might be rephrased in terms of using some other resource (which in turn requires at least a set amount of time).  So perhaps invent a decision problem around sorting, and appeal to the $n\ln(n)$ lower bound...
