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

Result page for benchmark
application/rintanen/SATPlanning/
transport-transport-three-cities-sequential-14nodes-1000size-4degree-100mindistance-4trucks-14packages-2008seed.040-NOTKNOWN.cnf

Jump to solvers results

General information on the benchmark

Nameapplication/rintanen/SATPlanning/
transport-transport-three-cities-sequential-14nodes-1000size-4degree-100mindistance-4trucks-14packages-2008seed.040-NOTKNOWN.cnf
MD5SUM6c2d25eda70423643946d76935ceb950
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 variables1512832
Number of clauses8233086
Sum of the clauses size19530286
Maximum clause length1178
Minimum clause length1
Number of clauses of size 1846
Number of clauses of size 28165680
Number of clauses of size 31280
Number of clauses of size 41600
Number of clauses of size 51600
Number of clauses of size over 562080

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400736? (MO) 29287.9 1387.14
claspmt 2.0-R4095-patched (fixed) (complete)3472382? (TO) 20522 5102.18
ppfolio par (complete)3347393? (TO) 149771 5100.03
Plingeling 587f (fixed) (complete)3372471? (TO) 157895 5102.11

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: