Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-warehouse0_wcsp.wbo |
MD5SUM | 1666aebbbae4b4440b4a935980e38a5c |
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 | 328 |
Best CPU time to get the best result obtained on this benchmark | 0.005999 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 60 |
Total number of constraints | 120 |
Number of soft constraints | 105 |
Number of constraints which are clauses | 105 |
Number of constraints which are cardinality constraints (but not clauses) | 15 |
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 | 954 |
Min constraint cost | 1 |
Max constraint cost | 954 |
Sum of constraints costs | 50513 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 6 |
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 |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448638 | OPTIMUM | 0.005999 | 0.00758209 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447901 | OPTIMUM | 0.041992 | 0.042178 |
Sat4j Resolution 2011-06-08 (complete) | 3492750 | OPTIMUM | 0.512921 | 0.281226 |
wbo 1.6 (complete) | 3447164 | ? (TO) | 1800.09 | 1800.04 |
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: 328-x48 -x49 -x50 -x51 x52 -x53 x54 x55 -x56 x57 -x58 -x59 x60