> avoids solving Version-SAT, which is NP-Complete

This is just a terrible argument. Sure the problem is NP-Complete to find an optimal solution for the general case, but you don't need to do that. You need to find a good-enough solution for the cases that people actually use. Heuristics for that problem are plenty fast and even finding the optimal solution is fast enough for most of the problems people are actually trying to use.