Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh12_wcsp.wbo |
MD5SUM | d787b0d4d15d2d5c6758a89f1cfd571b |
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.004998 |
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 | 950 |
Number of soft constraints | 850 |
Number of constraints which are clauses | 850 |
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 | 420926 |
Min constraint cost | 1 |
Max constraint cost | 1000 |
Sum of constraints costs | 420925 |
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) | 3448669 | OPTIMUM | 0.004998 | 0.00567608 |
Sat4j Resolution 2011-06-08 (complete) | 3492781 | OPTIMUM | 0.592909 | 0.337092 |
wbo 1.6 (complete) | 3447195 | MSAT | 0.003999 | 0.00597994 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447932 | MSAT (TO) | 1800.07 | 1800.02 |
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-x190 -x191 x192 -x193 x194 -x195 x196 x197 -x198 -x199 x200