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

Jump to solvers results

General information on the benchmark

Nameapplication/rintanen/SATPlanning/
openstacks-sequencedstrips-nonadl-nonnegated-os-sequencedstrips-p30_1.035-NOTKNOWN.cnf
MD5SUM28233bedeee44da6e79e63b9febc4d1e
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 variables133566
Number of clauses667976
Sum of the clauses size1591941
Maximum clause length63
Minimum clause length1
Number of clauses of size 1211
Number of clauses of size 2659295
Number of clauses of size 32100
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 56370

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Plingeling 587f (fixed) (complete)3372459? (TO) 158935 5102.41
claspmt 2.0-R4095-patched (fixed) (complete)3472378? (TO) 158956 5103.92
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400732? (TO) 159679 5112.54
ppfolio par (complete)3347385? (TO) 160002 5012.54

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: