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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/korf-18.cnf
MD5SUM47bea79e2bf12e18e409c2c4bd6fac03
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark10532
Satisfiable
(Un)Satisfiability was proved
Number of variables7794
Number of clauses186934
Sum of the clauses size1289969
Maximum clause length55
Minimum clause length1
Number of clauses of size 16
Number of clauses of size 220093
Number of clauses of size 316000
Number of clauses of size 45706
Number of clauses of size 56282
Number of clauses of size over 5138847

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400842UNSAT 10532 337.491
claspmt 2.0-R4095-patched (fixed) (complete)3472488UNSAT 19309.9 615.883
ppfolio par (complete)3347605UNSAT 53265 1669.93
Plingeling 587f (fixed) (complete)3372789UNSAT 54316.6 1706.45

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: