Name | /PARTIAL-SMALLINT-LIN/wcsp/spot5/ normalized-spot5-54_wcsp.wbo |
MD5SUM | 5da0482fa5c9a9d0a00dab78a5ff7041 |
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 | 37 |
Best CPU time to get the best result obtained on this benchmark | 0.432933 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 192 |
Total number of constraints | 546 |
Number of soft constraints | 479 |
Number of constraints which are clauses | 479 |
Number of constraints which are cardinality constraints (but not clauses) | 67 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 4 |
Top cost | 108 |
Min constraint cost | 1 |
Max constraint cost | 108 |
Sum of constraints costs | 44603 |
Biggest number in a constraint | 2 |
Number of bits of the biggest number in a constraint | 2 |
Biggest sum of numbers in a constraint | 5 |
Number of bits of the biggest sum of numbers | 3 |
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 |
---|---|---|---|---|
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447975 | OPTIMUM | 0.432933 | 0.433545 |
clasp 2.0-RC2 (complete) | 3448712 | OPTIMUM | 0.468928 | 0.470208 |
Sat4j Resolution 2011-06-08 (complete) | 3492824 | OPTIMUM | 2.16467 | 1.60381 |
wbo 1.6 (complete) | 3447238 | OPTIMUM | 5.82311 | 5.82282 |
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: 37x24 -x23 -x22 x21 x20 -x19 -x18 x17 x16 -x15 -x14 x13 x12 -x11 -x10 x9 -x8 x7 -x6 x5 -x4 x3 -x2 x1