| Name | application/rintanen/SATPlanning/ transport-transport-three-cities-sequential-14nodes-1000size-4degree-100mindistance-4trucks-14packages-2008seed.020-NOTKNOWN.cnf |
| MD5SUM | 5d1253e2dcc0e3e55992672756beadbc |
| Bench Category | APPLICATION (applications instances) |
| Best result obtained on this benchmark | SAT |
| Best CPU time to get the best result obtained on this benchmark | 2339.87 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 756832 |
| Number of clauses | 4116966 |
| Sum of the clauses size | 9765566 |
| Maximum clause length | 1178 |
| Minimum clause length | 1 |
| Number of clauses of size 1 | 846 |
| Number of clauses of size 2 | 4082840 |
| Number of clauses of size 3 | 640 |
| Number of clauses of size 4 | 800 |
| Number of clauses of size 5 | 800 |
| Number of clauses of size over 5 | 31040 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| CryptoMiniSat Strange-Night-2-mt (fixed) (complete) | 3400728 | SAT | 2339.87 | 89.3329 |
| ppfolio par (complete) | 3347377 | SAT | 7534.32 | 290.929 |
| claspmt 2.0-R4095-patched (fixed) (complete) | 3472374 | SAT | 44630.4 | 2621.43 |
| Plingeling 587f (fixed) (complete) | 3372447 | SAT | 101061 | 3237.44 |
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--