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

Result page for benchmark
APPLICATIONS/satComp09_BioInstances/
ndhf_xits_13_UNSAT.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/satComp09_BioInstances/
ndhf_xits_13_UNSAT.cnf
MD5SUMd4e16a803f6cd0903a2bd3e7157287b3
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 variables2730
Number of clauses271285
Sum of the clauses size809746
Maximum clause length14
Minimum clause length2
Number of clauses of size 10
Number of clauses of size 24450
Number of clauses of size 3266804
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)1775105? 3601.25 3602.53
SATzilla2009_I 2009-03-22 (complete)1775110? (exit code) 9997.61 10000.7
CircUs 2009-03-23 (complete)1775108? (exit code) 9999.56 10002.6
SAT07 reference solver: Rsat 2007-02-08 (complete)1825421? (TO) 10000 10003.3
minisat_cumr p-2009-03-18 (complete)1837538? (TO) 10000 10004.3
glucose 1.0 (complete)1775104? (TO) 10000 10002.7
Rsat 2009-03-22 (complete)1775109? (TO) 10000 10004.1
MiniSat 2.1 (Sat-race'08 Edition) (complete)1775102? (TO) 10000.1 10003.7
LySAT i/2009-03-20 (complete)1775103? (TO) 10000.1 10002.9
SAT07 reference solver: picosat 535 (complete)1825422? (TO) 10000.1 10003
SApperloT base (complete)1831918? (TO) 10000.1 10002.8
MiniSAT 09z 2009-03-22 (complete)1837539? (TO) 10000.1 10002.8
precosat 236 (complete)1775101? (TO) 10000.1 10002.5
clasp 1.2.0-SAT09-32 (complete)1831917? (TO) 10000.1 9999.07
ManySAT 1.1 aimd 1/2009-03-20 (complete)1775106? (TO) 10000.2 5013.62
MXC 2009-03-10 (complete)1775107? (TO) 10000.2 10004.3

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: