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

Result page for benchmark
APPLICATIONS/satComp09_BioInstances/
ndhf_xits_12_UNSAT.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/satComp09_BioInstances/
ndhf_xits_12_UNSAT.cnf
MD5SUMecc4810d82e30597ea8451526243ec09
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables2522
Number of clauses243459
Sum of the clauses size726523
Maximum clause length13
Minimum clause length2
Number of clauses of size 10
Number of clauses of size 24164
Number of clauses of size 3239264
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 531

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
kw 2009-03-20 (complete)1774975? 3601.12 3602.17
SATzilla2009_I 2009-03-22 (complete)1774980? (exit code) 9998.09 10000.7
CircUs 2009-03-23 (complete)1774978? (exit code) 10000 10003.6
LySAT i/2009-03-20 (complete)1774973? (TO) 10000 10003.3
MiniSAT 09z 2009-03-22 (complete)1837513? (TO) 10000 10003.7
MiniSat 2.1 (Sat-race'08 Edition) (complete)1774972? (TO) 10000 10002.9
SAT07 reference solver: picosat 535 (complete)1825396? (TO) 10000 10002.9
Rsat 2009-03-22 (complete)1774979? (TO) 10000 10002.5
SAT07 reference solver: Rsat 2007-02-08 (complete)1825395? (TO) 10000.1 10002.8
glucose 1.0 (complete)1774974? (TO) 10000.1 10005.1
SApperloT base (complete)1831892? (TO) 10000.1 10002.7
ManySAT 1.1 aimd 1/2009-03-20 (complete)1774976? (TO) 10000.1 5013.82
minisat_cumr p-2009-03-18 (complete)1837512? (TO) 10000.1 10002.9
MXC 2009-03-10 (complete)1774977? (TO) 10000.1 10004.1
precosat 236 (complete)1774971? (TO) 10000.1 10002.3
clasp 1.2.0-SAT09-32 (complete)1831891? (TO) 10000.1 10002.4

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: