Walksat is an incomplete solver. This means that it tries to find a solution for a number of iterations. If it does find a solution it answers with the solution, otherwise it answers "don't know". Walksat uses a form of random walk to search for solutions with heuristics to guide its step.
Minisat on the other hand, given enough computational resources, gives you either a solution or answer that the problem is unsatisfiable (and by adding a proof-trace you also get a proof). Minsat uses a modern form of DPLL.
The short answer to your question is that it is easier to search for an answer, if it exists, than proving than no answer exists.
The longer answer is that walksat is only faster than minisat if there is a lot of solutions and their structure is of a special kind in the search space.
On the page with benchmarks I could not find any reference to walksat. Have you testet walksat on some benchmarks yourself? Have you tested walksat on benchmarks that are known to be unsatisfiable?