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

Result page for benchmark
industrial/anbulagan/
hard-unsat/partial-5-13-u.cnf

Jump to solvers results

General information on the benchmark

Nameindustrial/anbulagan/
hard-unsat/partial-5-13-u.cnf
MD5SUM4bb23e70b97827425fcf5759bf0a79a2
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 variables184196
Number of clauses833889
Sum of the clauses size1904914
Maximum clause length10
Minimum clause length1
Number of clauses of size 113964
Number of clauses of size 2672565
Number of clauses of size 3112780
Number of clauses of size 43840
Number of clauses of size 515360
Number of clauses of size over 515380

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
kw 2009-03-20 (complete)1772685? 3605.23 3606.32
SATzilla2009_I 2009-03-22 (complete)1772690? (exit code) 9997.69 10003.5
minisat_cumr p-2009-03-18 (complete)1837054? (MO) 5803.19 5805.01
ManySAT 1.1 aimd 1/2009-03-20 (complete)1772686? (MO) 8694.35 4360.52
Rsat 2009-03-22 (complete)1772689? (TO) 10000 10002.4
SAT07 reference solver: Rsat 2007-02-08 (complete)1824785? (TO) 10000 10002.4
MiniSAT 09z 2009-03-22 (complete)1837055? (TO) 10000 10003.7
LySAT i/2009-03-20 (complete)1772683? (TO) 10000.1 10004.2
SAT07 reference solver: picosat 535 (complete)1824786? (TO) 10000.1 10004
glucose 1.0 (complete)1772684? (TO) 10000.1 10004.2
CircUs 2009-03-23 (complete)1772688? (TO) 10000.1 10004.1
precosat 236 (complete)1772681? (TO) 10000.2 10003.6
MXC 2009-03-10 (complete)1772687? (TO) 10000.2 10006
SApperloT base (complete)1831434? (TO) 10000.2 10005.2
clasp 1.2.0-SAT09-32 (complete)1831433? (TO) 10000.3 10003.5
MiniSat 2.1 (Sat-race'08 Edition) (complete)1772682? (TO) 10000.3 10005.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: