User blog comment:Wythagoras/A far better bound for TREE(3)/@comment-11227630-20140622124913/@comment-5150073-20140622125518

The matter is that we namely have to find the best sequence, otherwise we'd prove that tree(n) [\geq] f_{SVO}(n).