We study a notion of self-similarity for metric spaces called BPI (Big Pieces of Itself). In order to classify all the different BPI geometries, David and Semmes introduced the notion of "looking down". In this article, we prove that the product of finitely many euclidean lines, all equipped with the distance (x,y)→|x-y|p for some p<1, is not minimal for looking down.