Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh220_wcsp.wbo |
MD5SUM | 862c57b9a103de4e976a73e17aca1258 |
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.471927 |
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 |
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-x27 -x26 x25 x24 -x23 x22 -x21 x20 -x19 -x18 x17 -x16 x15 -x14 x13 x12 -x11 x10 -x9 x8 -x7 x6 -x5 x4 -x3 x2 -x1