| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-46s.smv--soft-66-100-0.wbo |
| MD5SUM | 0c4c750d54c7b762c4dc52b4dc547a5f |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 1 |
| Best CPU time to get the best result obtained on this benchmark | 0.552915 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1612 |
| Total number of constraints | 3653 |
| Number of soft constraints | 1247 |
| Number of constraints which are clauses | 3273 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 380 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 63484 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 63483 |
| Biggest number in a constraint | 79 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 268 |
| Number of bits of the biggest sum of numbers | 9 |
| 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) | 4110082 | OPTIMUM | 0.552915 | 0.554865 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110080 | OPTIMUM | 1.16282 | 0.557437 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110081 | OPTIMUM | 2.6536 | 2.4314 |
| NaPS 1.02 (complete) | 4110083 | OPTIMUM | 6.93094 | 6.93232 |
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: 1-x1611 -x1612