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. sources are available at github.

$ 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