Verifying a candidate solution for these problems is relatively easy so wrong answers aren't so bad.
To explain: the thing that's super interesting to me about this paper (i.e., "strong result" vs. "best paper contender") is not integration per se. It's the possible applications of the method to problems with much, much, much higher computational complexity than integration. On those problems, validating the correctness of a solution is also intractable. In those cases, a sound function approximation approach would be an absolute game changer for symbolic methods.
(Not that integration isn't interesting as well.)
Still, I fear, the numbers are currently too small to get past the information bottleneck (mere thousands). We'll see.