Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh202_wcsp.wbo |
MD5SUM | d13dffa73911787707d210cefbded5d8 |
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 | 68 |
Best CPU time to get the best result obtained on this benchmark | 0.174972 |
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 | 10 |
Top cost | 394239 |
Min constraint cost | 1 |
Max constraint cost | 1000 |
Sum of constraints costs | 394238 |
Biggest number in a constraint | 9 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 19 |
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) | 4110462 | OPTIMUM | 0.174972 | 0.177235 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110460 | OPTIMUM | 0.594908 | 0.34933 |
NaPS 1.02 (complete) | 4110463 | OPTIMUM | 0.855869 | 0.857514 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110461 | OPTIMUM | 1.00385 | 1.80356 |
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: 68-x191 x192 x193 -x194 x195 -x196 x197 -x198 -x199 x200