SAT 2009 Competition: main competition (phase2): solvers results per benchmarks

Result page for benchmark
industrial/palacios/uts/
uts-l05-ipc5-h26-unsat.cnf

Jump to solvers results

General information on the benchmark

Nameindustrial/palacios/uts/
uts-l05-ipc5-h26-unsat.cnf
MD5SUM4b97e69214a2eddbe060a9ecc3dfbbd8
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark10.1974
Satisfiable
(Un)Satisfiability was proved
Number of variables85694
Number of clauses414657
Sum of the clauses size1073659
Maximum clause length403
Minimum clause length1
Number of clauses of size 1190
Number of clauses of size 2330211
Number of clauses of size 380574
Number of clauses of size 4910
Number of clauses of size 5103
Number of clauses of size over 52669

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
glucose 1.0 (complete)1772934UNSAT 10.1974 10.2145
minisat_cumr p-2009-03-18 (complete)1837104UNSAT 15.9516 15.9626
MiniSAT 09z 2009-03-22 (complete)1837105UNSAT 16.5735 16.5968
SAT07 reference solver: Rsat 2007-02-08 (complete)1824835UNSAT 17.2254 17.236
LySAT i/2009-03-20 (complete)1772933UNSAT 18.9421 18.9528
MiniSat 2.1 (Sat-race'08 Edition) (complete)1772932UNSAT 20.005 20.2148
ManySAT 1.1 aimd 1/2009-03-20 (complete)1772936UNSAT 23.4464 15.8511
Rsat 2009-03-22 (complete)1772939UNSAT 29.4075 29.4225
precosat 236 (complete)1772931UNSAT 30.1804 30.1902
MXC 2009-03-10 (complete)1772937UNSAT 30.2664 30.2765
clasp 1.2.0-SAT09-32 (complete)1831483UNSAT 49.5635 49.5901
CircUs 2009-03-23 (complete)1772938UNSAT 51.6731 51.6903
SAT07 reference solver: picosat 535 (complete)1824836UNSAT 82.0025 82.0459
SATzilla2009_I 2009-03-22 (complete)1772940UNSAT 97.2832 97.3362
kw 2009-03-20 (complete)1772935UNSAT 194.069 194.074
SApperloT base (complete)1831484UNSAT 222.636 222.699

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found: