| Name | application/rintanen/SATPlanning/ transport-transport-two-cities-sequential-15nodes-1000size-3degree-100mindistance-3trucks-10packages-2008seed.040-SAT.cnf |
| MD5SUM | 74e0fa52e4789615985c73d0a8b105b4 |
| Bench Category | APPLICATION (applications instances) |
| Best result obtained on this benchmark | SAT |
| Best CPU time to get the best result obtained on this benchmark | 1856.09 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 580875 |
| Number of clauses | 3140965 |
| Sum of the clauses size | 7465165 |
| Maximum clause length | 602 |
| Minimum clause length | 1 |
| Number of clauses of size 1 | 445 |
| Number of clauses of size 2 | 3105720 |
| Number of clauses of size 3 | 720 |
| Number of clauses of size 4 | 720 |
| Number of clauses of size 5 | 1200 |
| Number of clauses of size over 5 | 32160 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| CryptoMiniSat Strange-Night-2-mt (fixed) (complete) | 3400727 | SAT | 1856.09 | 74.3475 |
| ppfolio par (complete) | 3347375 | SAT | 2292.5 | 107.855 |
| claspmt 2.0-R4095-patched (fixed) (complete) | 3472373 | SAT | 4094.56 | 887.728 |
| Plingeling 587f (fixed) (complete) | 3372444 | SAT | 12890.2 | 463.226 |
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--