| Name | /SOFT-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache.inv8.ucl--soft-0-100-0.wbo |
| MD5SUM | d41d4dcc01415e574abb081114a32401 |
| Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 16 |
| Best CPU time to get the best result obtained on this benchmark | 0.607907 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 2355 |
| Total number of constraints | 6744 |
| Number of soft constraints | 6744 |
| Number of constraints which are clauses | 6568 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 176 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 9 |
| Top cost | 341452 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 341451 |
| Biggest number in a constraint | 17 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 62 |
| Number of bits of the biggest sum of numbers | 6 |
| 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) | 4093044 | OPTIMUM | 0.607907 | 0.609626 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090272 | OPTIMUM | 1.57276 | 0.702193 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091658 | OPTIMUM | 3.42248 | 2.05185 |
| NaPS 1.02 (complete) | 4094430 | OPTIMUM | 34.0448 | 34.0639 |
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: 16x2351 -x2352 -x2353 -x2354 -x2355