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

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

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E15N15.cnf
MD5SUM3c60abce47126bbdfce1595a967e7025
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.05899
Satisfiable
(Un)Satisfiability was proved
Number of variables4740
Number of clauses44327
Sum of the clauses size217697
Maximum clause length36
Minimum clause length1
Number of clauses of size 146
Number of clauses of size 212551
Number of clauses of size 38440
Number of clauses of size 41440
Number of clauses of size 53015
Number of clauses of size over 518835

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
claspmt 2.0-R4095-patched (fixed) (complete)3472497UNSAT 0.05899 0.0609041
ppfolio par (complete)3347623UNSAT 0.108983 0.0439139
Plingeling 587f (fixed) (complete)3372816UNSAT 1.24181 1.22507
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400851UNSAT 4.10438 0.220773

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: