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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E05X15.cnf
MD5SUMe53b8f4e61e6411a209ad63833d35585
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark205.686
Satisfiable
(Un)Satisfiability was proved
Number of variables4740
Number of clauses41379
Sum of the clauses size183934
Maximum clause length45
Minimum clause length1
Number of clauses of size 17
Number of clauses of size 211966
Number of clauses of size 39700
Number of clauses of size 43195
Number of clauses of size 54425
Number of clauses of size over 512086

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400846UNSAT 205.686 7.56134
Plingeling 587f (fixed) (complete)3372801UNSAT 217.09 8.00846
claspmt 2.0-R4095-patched (fixed) (complete)3472492UNSAT 225.024 7.7443
ppfolio par (complete)3347613UNSAT 229.912 8.04922

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: