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.030-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.030-NOTKNOWN.cnf
MD5SUMc6d3480970bb2819448dd0a800a3cf1c
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark98266.1
Satisfiable
(Un)Satisfiability was proved
Number of variables1134832
Number of clauses6175026
Sum of the clauses size14647926
Maximum clause length1178
Minimum clause length1
Number of clauses of size 1846
Number of clauses of size 26124260
Number of clauses of size 3960
Number of clauses of size 41200
Number of clauses of size 51200
Number of clauses of size over 546560

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
ppfolio par (complete)3347403SAT 98266.1 3353.12
CryptoMiniSat Strange-Night-2-mt (fixed) (complete)3400741? (MO) 101948 10338.5
claspmt 2.0-R4095-patched (fixed) (complete)3472387? (TO) 58689.8 5104.02
Plingeling 587f (fixed) (complete)3372486? (TO) 159276 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:
--too large--