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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E00N23.cnf
MD5SUM1a1f0dddf727883e0973677dd00e9269
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables15364
Number of clauses2210893
Sum of the clauses size20370578
Maximum clause length105
Minimum clause length1
Number of clauses of size 128
Number of clauses of size 241189
Number of clauses of size 336730
Number of clauses of size 432798
Number of clauses of size 5188784
Number of clauses of size over 51911364

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
claspmt 2.0-R4095-patched (fixed) (complete)3472495? (TO) 158260 5103.11
Plingeling 587f (fixed) (complete)3372810? (TO) 160002 5068.77
ppfolio par (complete)3347619? (TO) 160002 5047.86
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400849? (TO) 160005 5022.23

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: