Linearize search space according to size of intermediates

So far we sort the search space by (1) sorting cutsets by their scores, and (2) appending all other interesting points in an ordered manner. This task aims to append all other interesting points sorted by their size of intermediates. Having large materializations higher in the tree increases the chances of pruning large sub areas of the search space.