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

Result page for benchmark
industrial/palacios/hard/
safe-30-h29-unsat.cnf

Jump to solvers results

General information on the benchmark

Nameindustrial/palacios/hard/
safe-30-h29-unsat.cnf
MD5SUM7cb48ce6f0320bc88623afd3c5af4aae
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 variables129128
Number of clauses437794
Sum of the clauses size1056806
Maximum clause length61
Minimum clause length1
Number of clauses of size 130
Number of clauses of size 2310376
Number of clauses of size 3124560
Number of clauses of size 4189
Number of clauses of size 583
Number of clauses of size over 52556

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
kw 2009-03-20 (complete)1772905? 3602.51 3603.43
SATzilla2009_I 2009-03-22 (complete)1772910? (exit code) 9998.27 10003.3
LySAT i/2009-03-20 (complete)1772903? (TO) 10000 10004.5
SAT07 reference solver: picosat 535 (complete)1824830? (TO) 10000.1 10002.6
minisat_cumr p-2009-03-18 (complete)1837098? (TO) 10000.1 10004.2
MiniSAT 09z 2009-03-22 (complete)1837099? (TO) 10000.1 10003.2
precosat 236 (complete)1772901? (TO) 10000.1 10003.6
MiniSat 2.1 (Sat-race'08 Edition) (complete)1772902? (TO) 10000.1 10002.9
SAT07 reference solver: Rsat 2007-02-08 (complete)1824829? (TO) 10000.1 10004
glucose 1.0 (complete)1772904? (TO) 10000.1 10004.6
ManySAT 1.1 aimd 1/2009-03-20 (complete)1772906? (TO) 10000.1 5020.82
clasp 1.2.0-SAT09-32 (complete)1831477? (TO) 10000.1 10002.8
SApperloT base (complete)1831478? (TO) 10000.1 10002.8
Rsat 2009-03-22 (complete)1772909? (TO) 10000.1 10004.8
MXC 2009-03-10 (complete)1772907? (TO) 10000.2 10000.2
CircUs 2009-03-23 (complete)1772908? (TO) 10000.2 10003.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: