PB'11 competition: satisfaction and optimization track: benchmarks results per solver

Result page for solver Sat4j CuttingPlanes 2.3.0 (complete)

Category "no optimisation, small integers, linear constraints" (DEC-SMALLINT-LIN)

Solver proved unsatisfiability (UNSATISFIABLE) (128 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) for a SAT/UNSAT instance (114 runs) [Show/Hide]

Solver timed out (no solution given) (239 runs) [Show/Hide]

Category "no optimisation, small integers, non linear constraints" (DEC-SMALLINT-NLC)

Solver proved unsatisfiability (UNSATISFIABLE) (15 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) for a SAT/UNSAT instance (50 runs) [Show/Hide]

Solver timed out (no solution given) (35 runs) [Show/Hide]

Category "optimisation, big integers, linear constraints" (OPT-BIGINT-LIN)

Solver proved unsatisfiability (UNSATISFIABLE) (59 runs) [Show/Hide]

Solver found optimum (OPTIMUM FOUND) (116 runs) [Show/Hide]

Solver timed out but found at least a solution (175 runs) [Show/Hide]