Consider a variant of a satisifiability problem.Given n dimensions (n >= 3, n < 10,000 think of n as large but finite)The range of each dimension is either an interval over the integers or an interval over the fixed-point decimals (which can be mapped to be the integers).Given a truth predicate which can use these operations:(<, =>, ==, !=, *, +, -, /, if/then, and}Example in Prolog of a predicate of truth:Predicate(V1, V2, V3) :-   V2 =< V3,   V1 * 5 =< V3,   V1 * 50 >= V3.Is this mappable to 3SAT?Is this less hard than 3SAT?What are pragmatic and efficient solutions to select some true point (or set of points) in the space?
Is this problem mappable to 3SAT or is it weaker than 3SAT?
cc.complexity theory;sat