Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh201_wcsp.wbo |
MD5SUM | 915acd3dc0a570e5bdb7222960ad66b3 |
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.013997 |
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 | 14 |
Top cost | 394239 |
Min constraint cost | 1 |
Max constraint cost | 1000 |
Sum of constraints costs | 394238 |
Biggest number in a constraint | 13 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 27 |
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) | 3448694 | OPTIMUM | 0.013997 | 0.014486 |
Sat4j Resolution 2011-06-08 (complete) | 3492806 | OPTIMUM | 0.476927 | 0.302581 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447957 | OPTIMUM | 136.325 | 136.323 |
wbo 1.6 (complete) | 3447220 | MSAT | 0.004998 | 0.00581599 |
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: 0-x191 x192 x193 -x194 -x195 x196 -x197 x198 x199 -x200