If a CSP (over a finite domain) has only linear inequalities as constraints, is it solvable in linear time?
Probably not, since clauses can be encoded using only linear inequalities.
http://web.stanford.edu/~rrwill/cnf-sat-feasible.pdf