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

Result page for benchmark
application/rintanen/SATPlanning/
openstacks-sequencedstrips-nonadl-nonnegated-os-sequencedstrips-p30_1.045-NOTKNOWN.cnf

Jump to solvers results

General information on the benchmark

Nameapplication/rintanen/SATPlanning/
openstacks-sequencedstrips-nonadl-nonnegated-os-sequencedstrips-p30_1.045-NOTKNOWN.cnf
MD5SUM0385ba51f44fb47d0b0726e26312816f
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 variables171676
Number of clauses858766
Sum of the clauses size2046721
Maximum clause length63
Minimum clause length1
Number of clauses of size 1211
Number of clauses of size 2847665
Number of clauses of size 32700
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 58190

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400718? (TO) 150500 5111.48
claspmt 2.0-R4095-patched (fixed) (complete)3472364? (TO) 156488 5105.31
Plingeling 587f (fixed) (complete)3372417? (TO) 158742 5101.97
ppfolio par (complete)3347357? (TO) 160003 5013.94

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: