| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9014_1-unsat--soft-66-100-0.wbo |
| MD5SUM | 6c5df40b176000d7248c596dfbe96e3b |
| 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 | 6 |
| Best CPU time to get the best result obtained on this benchmark | 39.529 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 16198 |
| Total number of constraints | 50975 |
| Number of soft constraints | 17448 |
| Number of constraints which are clauses | 50623 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 352 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 90 |
| Top cost | 887339 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 887338 |
| Biggest number in a constraint | 51 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 588 |
| 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 |
|---|---|---|---|---|
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090703 | OPTIMUM | 5.8941 | 4.15787 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092089 | OPTIMUM | 24.3593 | 28.0762 |
| toysat 2016-05-02 (complete) | 4093475 | OPTIMUM | 39.529 | 39.5362 |
| NaPS 1.02 (complete) | 4094861 | OPTIMUM | 309.832 | 309.879 |
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: 6--too large--