Name | /PARTIAL-SMALLINT-LIN/wcsp/spot5/ normalized-spot5-404_wcsp.wbo |
MD5SUM | 2413d46290c8b1663f08f424871383e0 |
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 | 114 |
Best CPU time to get the best result obtained on this benchmark | 0.566912 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 258 |
Total number of constraints | 1137 |
Number of soft constraints | 1037 |
Number of constraints which are clauses | 1037 |
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 | 1 |
Maximum length of a constraint | 4 |
Top cost | 164 |
Min constraint cost | 1 |
Max constraint cost | 164 |
Sum of constraints costs | 153831 |
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) | 3447976 | OPTIMUM | 0.566912 | 0.567069 |
wbo 1.6 (complete) | 3447239 | OPTIMUM | 1456.91 | 1456.86 |
clasp 2.0-RC2 (complete) | 3448713 | MSAT (TO) | 1800.03 | 1800.01 |
Sat4j Resolution 2011-06-08 (complete) | 3492825 | MSAT (TO) | 1800.1 | 1797.23 |
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: 114x20 -x19 x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 x6 -x5 -x4 -x3 x2 -x1