| Name | application/rintanen/SATPlanning/ transport-transport-city-sequential-25nodes-1000size-3degree-100mindistance-3trucks-10packages-2008seed.060-SAT.cnf |
| MD5SUM | 0176f3dd09fed1b561c875e1d6538c8d |
| Bench Category | APPLICATION (applications instances) |
| Best result obtained on this benchmark | SAT |
| Best CPU time to get the best result obtained on this benchmark | 2239.87 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 723130 |
| Number of clauses | 3869060 |
| Sum of the clauses size | 9210860 |
| Maximum clause length | 502 |
| Minimum clause length | 1 |
| Number of clauses of size 1 | 380 |
| Number of clauses of size 2 | 3824280 |
| Number of clauses of size 3 | 1440 |
| Number of clauses of size 4 | 1440 |
| Number of clauses of size 5 | 360 |
| Number of clauses of size over 5 | 41160 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| ppfolio par (complete) | 3347401 | SAT | 2239.87 | 116.1 |
| claspmt 2.0-R4095-patched (fixed) (complete) | 3472386 | SAT | 3636.74 | 844.567 |
| Plingeling 587f (fixed) (complete) | 3372483 | SAT | 13201.3 | 492.989 |
| CryptoMiniSat Strange-Night-2-mt (fixed) (complete) | 3400740 | ? (MO) | 19698.8 | 757.574 |
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--