We consider the standard semidefinite programming (SDP) relaxation for the vertex cover problem to which all hypermetric inequalities supported on at most k vertices are added and show that the integrality gap for such SDPs remains 2− o(1) even for k = O( √ logn/ log log n). This extends results by Kleinberg-Goemans, Charikar and Hatami et al. who considered vertex cover SDPs tightened using th...