| Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh207_wcsp.wbo |
| MD5SUM | a376d7f23eea0592d561601b8922f58b |
| 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 | 0 |
| Best CPU time to get the best result obtained on this benchmark | 0.005998 |
| 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 | 900 |
| Number of soft constraints | 800 |
| Number of constraints which are clauses | 800 |
| 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 | 11 |
| Top cost | 394239 |
| Min constraint cost | 1 |
| Max constraint cost | 1000 |
| Sum of constraints costs | 394238 |
| Biggest number in a constraint | 10 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 21 |
| 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) | 3448672 | OPTIMUM | 0.005998 | 0.00620306 |
| Sat4j Resolution 2011-06-08 (complete) | 3492784 | OPTIMUM | 0.634903 | 0.36066 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447935 | OPTIMUM | 216.67 | 216.664 |
| wbo 1.6 (complete) | 3447198 | MSAT | 0.003998 | 0.00574003 |
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: 0x190 -x191 x192 -x193 x194 x195 -x196 -x197 x198 x199 -x200