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

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

Jump to solvers results

General information on the benchmark

Nameapplication/rintanen/SATPlanning/
openstacks-sequencedstrips-nonadl-nonnegated-os-sequencedstrips-p30_3.045-NOTKNOWN.cnf
MD5SUM4ab53801f3b1a3f7169c9fb38cba4184
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 clauses870241
Sum of the clauses size2069671
Maximum clause length63
Minimum clause length1
Number of clauses of size 1211
Number of clauses of size 2859140
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)3400730? (TO) 149982 5110.91
claspmt 2.0-R4095-patched (fixed) (complete)3472376? (TO) 156344 5105.12
Plingeling 587f (fixed) (complete)3372453? (TO) 158720 5102.21
ppfolio par (complete)3347381? (TO) 160003 5014.44

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: