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

Result page for benchmark
application/leberre/
2dimensionalstrippacking/E03N17.cnf

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E03N17.cnf
MD5SUMa7330fdd412cca5ee2ec4c82638d1610
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark8.25274
Satisfiable
(Un)Satisfiability was proved
Number of variables6664
Number of clauses93544
Sum of the clauses size502355
Maximum clause length55
Minimum clause length1
Number of clauses of size 133
Number of clauses of size 217523
Number of clauses of size 313696
Number of clauses of size 42771
Number of clauses of size 515844
Number of clauses of size over 543677

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
ppfolio par (complete)3347599UNSAT 8.25274 1.66802
claspmt 2.0-R4095-patched (fixed) (complete)3472485UNSAT 14.8417 1.94696
Plingeling 587f (fixed) (complete)3372780UNSAT 49.8874 3.50195
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400839UNSAT 100.301 4.94302

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: