Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-85-80--soft-33-100-0.wbo |
MD5SUM | b2b0b6245f8ec2d35e44e032ffc67cea |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 0.791878 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 6800 |
Total number of constraints | 165 |
Number of soft constraints | 110 |
Number of constraints which are clauses | 85 |
Number of constraints which are cardinality constraints (but not clauses) | 80 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 80 |
Maximum length of a constraint | 85 |
Top cost | 6303 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 6302 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 86 |
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) | 3447492 | OPTIMUM | 0.791878 | 0.792571 |
clasp 2.0-RC2 (complete) | 3448359 | MSAT (TO) | 1800.06 | 1800.01 |
Sat4j Resolution 2011-06-08 (complete) | 3492295 | MSAT (TO) | 1800.14 | 1796.27 |
wbo 1.6 (complete) | 3446755 | ? (TO) | 1800.08 | 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: 1-x7 -x6 -x5 -x4 -x3 -x2 -x1