a solver for linear integer arithmetic

$ cutsat --help

cutsat is a solver for feasibiliy problems in linear integer arithmetic. as input formats, it supports the smt, mps, and opb formats. developement is still underway, but you can check out the developement packages from our launchpad page. for any questions or discussion please see the google group.

$ cutsat --show-benchmarks

these are the benchmarks we used in our cade 2011 paper. you can download the binary (64bit linux, early prototype) we used, and all benchmarks (tar.bz [122mb]), or one of the individual problem sets:

$ cutsat --science


dejan