Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-zebra_wcsp.wbo |
MD5SUM | fd165bcc49ab0d58e5df6e322efb7976 |
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.068988 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 125 |
Total number of constraints | 15290 |
Number of soft constraints | 15265 |
Number of constraints which are clauses | 15265 |
Number of constraints which are cardinality constraints (but not clauses) | 25 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 5 |
Top cost | 1 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 15265 |
Biggest number in a constraint | 4 |
Number of bits of the biggest number in a constraint | 3 |
Biggest sum of numbers in a constraint | 9 |
Number of bits of the biggest sum of numbers | 4 |
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) | 3448639 | OPTIMUM | 0.068988 | 0.069026 |
Sat4j Resolution 2011-06-08 (complete) | 3492751 | OPTIMUM | 1.81672 | 0.890326 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447902 | OPTIMUM | 9.15861 | 9.15941 |
wbo 1.6 (complete) | 3447165 | MSAT | 0.048991 | 0.0503539 |
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-x120 -x121 x122 -x123 -x124 -x125