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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E00X23.cnf
MD5SUM9cec6483d4ca03e8555377ba059b61ae
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 clauses2133873
Sum of the clauses size18060684
Maximum clause length91
Minimum clause length1
Number of clauses of size 116
Number of clauses of size 240913
Number of clauses of size 337518
Number of clauses of size 422333
Number of clauses of size 5147683
Number of clauses of size over 51885410

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
claspmt 2.0-R4095-patched (fixed) (complete)3472494? (TO) 158322 5103.05
Plingeling 587f (fixed) (complete)3372807? (TO) 160003 5063.48
ppfolio par (complete)3347617? (TO) 160004 5044.66
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400848? (TO) 160006 5021.96

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: