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

Result page for benchmark
APPLICATIONS/satComp09_BioInstances/
ndhf_xits_09_UNSAT.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/satComp09_BioInstances/
ndhf_xits_09_UNSAT.cnf
MD5SUM3cd74d1813a4408b4123afc23df07d7d
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 variables1910
Number of clauses167931
Sum of the clauses size500698
Maximum clause length10
Minimum clause length2
Number of clauses of size 10
Number of clauses of size 23312
Number of clauses of size 3164588
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)1775155? 3600.82 3602.08
SATzilla2009_I 2009-03-22 (complete)1775160? (exit code) 9998.39 10001.4
CircUs 2009-03-23 (complete)1775158? (exit code) 9999.75 10003.4
LySAT i/2009-03-20 (complete)1775153? (TO) 10000 10005
minisat_cumr p-2009-03-18 (complete)1837548? (TO) 10000 10002.4
MiniSAT 09z 2009-03-22 (complete)1837549? (TO) 10000 10004.6
SAT07 reference solver: Rsat 2007-02-08 (complete)1825431? (TO) 10000 9999.51
MiniSat 2.1 (Sat-race'08 Edition) (complete)1775152? (TO) 10000.1 10002.6
SAT07 reference solver: picosat 535 (complete)1825432? (TO) 10000.1 10002.5
glucose 1.0 (complete)1775154? (TO) 10000.1 10004.8
SApperloT base (complete)1831928? (TO) 10000.1 10002.7
ManySAT 1.1 aimd 1/2009-03-20 (complete)1775156? (TO) 10000.1 5012.92
MXC 2009-03-10 (complete)1775157? (TO) 10000.1 10003.2
clasp 1.2.0-SAT09-32 (complete)1831927? (TO) 10000.1 10003
Rsat 2009-03-22 (complete)1775159? (TO) 10000.1 10003.3
precosat 236 (complete)1775151? (TO) 10000.1 10002.5

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: