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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/korf-15.cnf
MD5SUMb5f600e7f9b30a5ff851f80fa6100290
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark100.517
Satisfiable
(Un)Satisfiability was proved
Number of variables4740
Number of clauses45569
Sum of the clauses size233173
Maximum clause length45
Minimum clause length1
Number of clauses of size 112
Number of clauses of size 212041
Number of clauses of size 38754
Number of clauses of size 41380
Number of clauses of size 52160
Number of clauses of size over 521222

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400836UNSAT 100.517 3.96848
claspmt 2.0-R4095-patched (fixed) (complete)3472482UNSAT 110.63 4.36219
ppfolio par (complete)3347593UNSAT 165.604 6.00537
Plingeling 587f (fixed) (complete)3372771UNSAT 270.842 9.66319

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: