SAT 2011 Competition: 32 cores track: solvers results per benchmarks

Result page for benchmark
application/leberre/
2dimensionalstrippacking/korf-17.cnf

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/korf-17.cnf
MD5SUMade81e5508101352b3d942708b201606
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark4721.17
Satisfiable
(Un)Satisfiability was proved
Number of variables6664
Number of clauses89966
Sum of the clauses size425665
Maximum clause length36
Minimum clause length2
Number of clauses of size 10
Number of clauses of size 216962
Number of clauses of size 310874
Number of clauses of size 412189
Number of clauses of size 522355
Number of clauses of size over 527586

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
claspmt 2.0-R4095-patched (fixed) (complete)3472491UNSAT 4721.17 150.265
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400845UNSAT 12542.5 394.347
ppfolio par (complete)3347611UNSAT 18059.3 566.644
Plingeling 587f (fixed) (complete)3372798UNSAT 30495.3 957.866

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: