| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-25s.smv--soft-66-100-0.wbo |
| MD5SUM | a96e8ec93fa53032ae0ea101ae8e779b |
| 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 | 1.42078 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 5072 |
| Total number of constraints | 12829 |
| Number of soft constraints | 4377 |
| Number of constraints which are clauses | 11721 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1108 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 15 |
| Top cost | 225332 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 225331 |
| 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) | 4110034 | OPTIMUM | 1.42078 | 1.4223 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110032 | OPTIMUM | 1.9937 | 0.86636 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110033 | OPTIMUM | 4.18336 | 2.90962 |
| NaPS 1.02 (complete) | 4110035 | OPTIMUM | 35.7006 | 35.7069 |
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: 1x5071 x5072