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

Result page for benchmark
industrial/anbulagan/
hard-unsat/total-5-15-u.cnf

Jump to solvers results

General information on the benchmark

Nameindustrial/anbulagan/
hard-unsat/total-5-15-u.cnf
MD5SUMc438ce1eb243ac0a49869eda1166f28f
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 variables219756
Number of clauses1008653
Sum of the clauses size2316156
Maximum clause length10
Minimum clause length1
Number of clauses of size 118434
Number of clauses of size 2797195
Number of clauses of size 3151604
Number of clauses of size 44600
Number of clauses of size 518400
Number of clauses of size over 518420

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
kw 2009-03-20 (complete)1772675? 3606.12 3607.78
SATzilla2009_I 2009-03-22 (complete)1772680? (exit code) 9998.33 10001
CircUs 2009-03-23 (complete)1772678? (exit code) 9999.99 10003.5
SAT07 reference solver: Rsat 2007-02-08 (complete)1824783? (TO) 10000 10002.5
Rsat 2009-03-22 (complete)1772679? (TO) 10000 10003
minisat_cumr p-2009-03-18 (complete)1837052? (TO) 10000 10004.6
MiniSAT 09z 2009-03-22 (complete)1837053? (TO) 10000 10003.2
ManySAT 1.1 aimd 1/2009-03-20 (complete)1772676? (TO) 10000.1 5016.12
SAT07 reference solver: picosat 535 (complete)1824784? (TO) 10000.1 10004.4
clasp 1.2.0-SAT09-32 (complete)1831431? (TO) 10000.1 10002.9
precosat 236 (complete)1772671? (TO) 10000.1 10002.9
LySAT i/2009-03-20 (complete)1772673? (TO) 10000.1 10004.5
glucose 1.0 (complete)1772674? (TO) 10000.1 10003.1
MXC 2009-03-10 (complete)1772677? (TO) 10000.1 10003.6
MiniSat 2.1 (Sat-race'08 Edition) (complete)1772672? (TO) 10000.2 10002.6
SApperloT base (complete)1831432? (TO) 10000.2 10003.9

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: