| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-22s.smv--soft-33-100-0.wbo |
| MD5SUM | 3ccb93ae8827142e7c54ff7ef98be667 |
| 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 | 2.25766 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 5985 |
| Total number of constraints | 15365 |
| Number of soft constraints | 10251 |
| Number of constraints which are clauses | 14013 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1352 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 15 |
| Top cost | 518757 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 518756 |
| Biggest number in a constraint | 165 |
| Number of bits of the biggest number in a constraint | 8 |
| Biggest sum of numbers in a constraint | 546 |
| Number of bits of the biggest sum of numbers | 10 |
| 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) | 4093421 | OPTIMUM | 2.25766 | 2.2589 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090649 | OPTIMUM | 2.78458 | 1.19659 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092035 | OPTIMUM | 7.29289 | 8.17817 |
| NaPS 1.02 (complete) | 4094807 | OPTIMUM | 166.983 | 167.01 |
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: 1x5981 x5982 -x5983 x5984 x5985