Abstract. We prove the first superlinear lower bound for a concrete, polynomial time recognizable decision problem on a Taring machine with one work tape and a two-way input tape (also called off-line 1-tape Turing machine).In particular, for offline Turing machines we show that two tapes are better than one and that three pushdown stores are better than two (both in the deterministic and in the nondeterministic case).