The inequality-satisfiability problem

We define a generalization of the satisfiability problem (SAT) where each “clause” is an or-list of inequalities in n variables. This problem is NP-complete even when containing only two inequalities per “clause”, but solvable in polynomial time when either the number of variables or the number of “clauses” is fixed.