| Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh308_wcsp.wbo |
| MD5SUM | 9e4ae11dd0361dce6825f0168cc6adb2 |
| 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 | 130 |
| Best CPU time to get the best result obtained on this benchmark | 0.934857 |
| 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 | 11 |
| Top cost | 444855 |
| Min constraint cost | 1 |
| Max constraint cost | 1000 |
| Sum of constraints costs | 444854 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4110474 | OPTIMUM | 0.934857 | 0.93627 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110472 | OPTIMUM | 1.16282 | 0.537846 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110473 | OPTIMUM | 2.02369 | 3.84083 |
| NaPS 1.02 (complete) | 4110475 | OPTIMUM | 17.8983 | 17.9082 |
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: 130-x191 x192 -x193 x194 -x195 x196 -x197 x198 -x199 x200