Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-105-100--soft-33-100-0.wbo |
MD5SUM | 5089c419eb4145debb9fb5e7fd1214f5 |
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 | 3 |
Best CPU time to get the best result obtained on this benchmark | 1.21181 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 10500 |
Total number of constraints | 205 |
Number of soft constraints | 132 |
Number of constraints which are clauses | 105 |
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 | 100 |
Maximum length of a constraint | 105 |
Top cost | 6845 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 6844 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 106 |
Number of bits of the biggest sum of numbers | 7 |
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) | 3447483 | OPTIMUM | 1.21181 | 1.21155 |
clasp 2.0-RC2 (complete) | 3448350 | MSAT (TO) | 1800.06 | 1800.01 |
Sat4j Resolution 2011-06-08 (complete) | 3492286 | MSAT (TO) | 1800.13 | 1796.68 |
wbo 1.6 (complete) | 3446746 | ? (TO) | 1800.07 | 1800.03 |
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: 3-x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1