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.025-NOTKNOWN.cnf

Jump to solvers results

General information on the benchmark

Nameapplication/rintanen/SATPlanning/
openstacks-sequencedstrips-nonadl-nonnegated-os-sequencedstrips-p30_1.025-NOTKNOWN.cnf
MD5SUM732b9c9b0d44d6a9e75489b2f5004165
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark50676.1
Satisfiable
(Un)Satisfiability was proved
Number of variables95456
Number of clauses477186
Sum of the clauses size1137161
Maximum clause length63
Minimum clause length1
Number of clauses of size 1211
Number of clauses of size 2470925
Number of clauses of size 31500
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 54550

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400731UNSAT 50676.1 1620.85
ppfolio par (complete)3347383? (TO) 160003 5009.84
Plingeling 587f (fixed) (complete)3372456? (TO) 160004 5028.52
claspmt 2.0-R4095-patched (fixed) (complete)3472377? (TO) 160046 5125.99

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: