| Name | /PARTIAL-BIGINT-LIN/wcsp/ logistics/normalized-logistics01ac_wcsp.wbo |
| MD5SUM | 01957484b2c99b85e5a2190fb59000ea |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 8265 |
| Best CPU time to get the best result obtained on this benchmark | 0.287955 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 490 |
| Total number of constraints | 3171 |
| Number of soft constraints | 3007 |
| Number of constraints which are clauses | 3007 |
| Number of constraints which are cardinality constraints (but not clauses) | 164 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 4 |
| Top cost | 70552 |
| Min constraint cost | 1 |
| Max constraint cost | 70552 |
| Sum of constraints costs | 198669792 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 5 |
| Number of bits of the biggest sum of numbers | 3 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093181 | OPTIMUM | 0.287955 | 0.288937 |
| NaPS 1.02 (complete) | 4094567 | OPTIMUM | 0.951855 | 0.951275 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090409 | OPTIMUM | 1.3248 | 0.630819 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091795 | OPTIMUM | 2.6116 | 1.94313 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
cost of falsified constraints: 8265x481 -x482 x483 -x484 x485 -x486 -x487 x488 -x489 x490