| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-44s.smv--soft-33-100-0.wbo |
| MD5SUM | 3545a507d8022035a27eeba1d33d0d09 |
| 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.231964 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 495 |
| Total number of constraints | 940 |
| Number of soft constraints | 612 |
| Number of constraints which are clauses | 800 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 140 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 31247 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 31246 |
| Biggest number in a constraint | 68 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 257 |
| 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) | 4110058 | OPTIMUM | 0.231964 | 0.232475 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110056 | OPTIMUM | 0.763882 | 0.405141 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110057 | OPTIMUM | 1.3038 | 1.79992 |
| NaPS 1.02 (complete) | 4110059 | OPTIMUM | 1.51877 | 1.51869 |
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: 1x491 x492 x493 x494 x495