It does suggest that there are many important problems out there that are amenable to relatively cheap brute force search at this point.

A lovely thing in math is that a counterexample, especially if it leads to infinitely more counterexamples in a particular class, can teach you more about the problem. I find this article hopeful. It made me excited about knot theory for the first time in a while.