# Pebble game lower bound?

This paper says pebble games have super linear lower bound for every fixed $$k$$ https://dl.acm.org/citation.cfm?doid=62.322433.

Why is it not considered proof of constructive example for a function in $$NP$$ which requires superlinear runtime?