Hi. This is a problem from theory of computation complexity. And the task is to show that SATISFIABILITY problem can be reduced to INTEGER problem. I can do that, but I will need definition of SATISFIABILITY problem you have, because there can be slight variations. I suppose it should be boolean satisfiability for conjunctive normal form problem.