| Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh302_wcsp.wbo |
| MD5SUM | 8b86218007c145a9ce1787d0bbf0d30b |
| 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 | 395 |
| Best CPU time to get the best result obtained on this benchmark | 0.12698 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 200 |
| Total number of constraints | 1000 |
| Number of soft constraints | 900 |
| Number of constraints which are clauses | 900 |
| Number of constraints which are cardinality constraints (but not clauses) | 100 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 10 |
| Top cost | 444855 |
| Min constraint cost | 1 |
| Max constraint cost | 1000 |
| Sum of constraints costs | 444854 |
| Biggest number in a constraint | 9 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 19 |
| Number of bits of the biggest sum of numbers | 5 |
| 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 |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448668 | OPTIMUM | 0.12698 | 0.126869 |
| Sat4j Resolution 2011-06-08 (complete) | 3492780 | OPTIMUM | 0.928858 | 0.479657 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447931 | MSAT (TO) | 1800.07 | 1800.02 |
| wbo 1.6 (complete) | 3447194 | ? (TO) | 1800.07 | 1800.03 |
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: 395x191 -x192 -x193 x194 -x195 x196 x197 -x198 -x199 x200