I am a PhD student in the Theoretical Computer Science group at KTH Royal Institute of Technology. I work on SAT solving, within the Proof complexity and SAT solving project supervised by prof. Jakob Nordström.
cdcl-cuttingplanes is a pseudo-boolean solver that participated in the pseudo-boolean evaluation (2015, 2016).
The Linux 64-bit binary (statically built) of the latest version can be downloaded here.
cdcl-cuttingplanes is copyrighted 2014-2017 by Jan Elffers. All rights reserved.
cdcl-cuttingplanes is available for research and evaluation purposes only and not for commercial use. cdcl-cuttingplanes is provided as is, without any warranty.