In this section, we prove that any class of tournaments with unbounded
twin-width contains one of the classes of obstructions described in sec:obstructions,
by combining BST and chain orders from the previous section
with the techniques developed in [1]} for ordered graphs.
We in fact show a stronger statement: either all BST orders are witness of bounded twin-width,
or the class contains one of the classes of obstructions.
