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

Result page for benchmark
APPLICATIONS/satComp09_BioInstances/
rbcl_xits_07_UNSAT.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/satComp09_BioInstances/
rbcl_xits_07_UNSAT.cnf
MD5SUM6419e2e5b92274df2e7e43e6c6a98566
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark120.626
Satisfiable
(Un)Satisfiability was proved
Number of variables1128
Number of clauses57446
Sum of the clauses size170514
Maximum clause length8
Minimum clause length2
Number of clauses of size 10
Number of clauses of size 21939
Number of clauses of size 355484
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
MiniSat 2.1 (Sat-race'08 Edition) (complete)1775132UNSAT 120.626 120.654
precosat 236 (complete)1775131UNSAT 194.62 194.693
SApperloT base (complete)1831924UNSAT 251.352 251.431
MXC 2009-03-10 (complete)1775137UNSAT 374.872 374.964
clasp 1.2.0-SAT09-32 (complete)1831923UNSAT 464.644 464.768
Rsat 2009-03-22 (complete)1775139UNSAT 548.799 548.94
glucose 1.0 (complete)1775134UNSAT 624.644 624.925
SATzilla2009_I 2009-03-22 (complete)1775140UNSAT 661.999 662.303
CircUs 2009-03-23 (complete)1775138UNSAT 662.951 663.138
SAT07 reference solver: picosat 535 (complete)1825428UNSAT 797.564 797.761
ManySAT 1.1 aimd 1/2009-03-20 (complete)1775136UNSAT 904.595 453.76
LySAT i/2009-03-20 (complete)1775133UNSAT 906.233 906.618
MiniSAT 09z 2009-03-22 (complete)1837545UNSAT 998.167 998.473
kw 2009-03-20 (complete)1775135UNSAT 1279.28 1279.67
minisat_cumr p-2009-03-18 (complete)1837544UNSAT 3206.19 3207.25
SAT07 reference solver: Rsat 2007-02-08 (complete)1825427UNSAT 6324.36 6326.04

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: