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

Result page for benchmark
APPLICATIONS/satComp09_BioInstances/
rpoc_xits_08_UNSAT.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/satComp09_BioInstances/
rpoc_xits_08_UNSAT.cnf
MD5SUM0b7170d33b896e8b879b19b65ac5c517
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1327.52
Satisfiable
(Un)Satisfiability was proved
Number of variables1278
Number of clauses74789
Sum of the clauses size222346
Maximum clause length9
Minimum clause length2
Number of clauses of size 10
Number of clauses of size 22159
Number of clauses of size 372607
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 523

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
precosat 236 (complete)1774941UNSAT 1327.52 1327.9
clasp 1.2.0-SAT09-32 (complete)1831885UNSAT 2214.93 2215.51
SApperloT base (complete)1831886UNSAT 3080.53 3081.23
MiniSat 2.1 (Sat-race'08 Edition) (complete)1774942UNSAT 3151.09 3151.89
MXC 2009-03-10 (complete)1774947UNSAT 5307.27 5308.55
SATzilla2009_I 2009-03-22 (complete)1774950UNSAT 9740.65 9745.51
glucose 1.0 (complete)1774944UNSAT 9905.29 9908.1
kw 2009-03-20 (complete)1774945? 3600.36 3601.36
CircUs 2009-03-23 (complete)1774948? (exit code) 9998.83 10001.5
LySAT i/2009-03-20 (complete)1774943? (TO) 10000 10003
Rsat 2009-03-22 (complete)1774949? (TO) 10000 10004.3
MiniSAT 09z 2009-03-22 (complete)1837507? (TO) 10000.1 10005.1
minisat_cumr p-2009-03-18 (complete)1837506? (TO) 10000.1 10003.1
SAT07 reference solver: Rsat 2007-02-08 (complete)1825389? (TO) 10000.1 10003.5
SAT07 reference solver: picosat 535 (complete)1825390? (TO) 10000.1 10002.4
ManySAT 1.1 aimd 1/2009-03-20 (complete)1774946? (TO) 10000.2 5011.53

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: