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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E07N15.cnf
MD5SUMa46c1f5024d18f7ce38b8231a36b8546
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.054991
Satisfiable
(Un)Satisfiability was proved
Number of variables4740
Number of clauses41363
Sum of the clauses size204185
Maximum clause length66
Minimum clause length1
Number of clauses of size 145
Number of clauses of size 212536
Number of clauses of size 38532
Number of clauses of size 41080
Number of clauses of size 52790
Number of clauses of size over 516380

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
claspmt 2.0-R4095-patched (fixed) (complete)3472496UNSAT 0.054991 0.0568899
ppfolio par (complete)3347621UNSAT 0.174972 0.0431429
Plingeling 587f (fixed) (complete)3372813UNSAT 1.13983 1.13451
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400850UNSAT 3.11652 0.189578

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: