Recently Edelman and Reiner suggested two poset structures, scriptS1(n, d) and scriptS2(n, d) on the set of all triangulations of the cyclic d‐polytope C(n, d) with n vertices. Both posets are generalizations of the well‐studied Tamari lattice. While scriptS2(n, d) is bounded by definition, the same is not obvious for scriptS1(n, d). In the paper by Edelman and Reiner the bounds of scriptS2(n, d) were also confirmed for scriptS1(n, d) whenever d≤5, leaving the general case as a conjecture.