Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-35-30--soft-66-100-0.wbo |
MD5SUM | 855765d60afa4a3ed9dadddc2a73110a |
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 | 23 |
Best CPU time to get the best result obtained on this benchmark | 0.066989 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 1050 |
Total number of constraints | 65 |
Number of soft constraints | 17 |
Number of constraints which are clauses | 35 |
Number of constraints which are cardinality constraints (but not clauses) | 30 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 30 |
Maximum length of a constraint | 35 |
Top cost | 939 |
Min constraint cost | 1 |
Max constraint cost | 96 |
Sum of constraints costs | 938 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 36 |
Number of bits of the biggest sum of numbers | 6 |
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) | 3447490 | OPTIMUM | 0.066989 | 0.0677391 |
clasp 2.0-RC2 (complete) | 3448357 | MSAT (TO) | 1800.05 | 1800.01 |
Sat4j Resolution 2011-06-08 (complete) | 3492293 | MSAT (TO) | 1800.15 | 1797.15 |
wbo 1.6 (complete) | 3446753 | ? (TO) | 1800.1 | 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: 23x15 x14 x13 x12 x11 x10 x9 x8 x7 x6 x5 x4 x3 x2 x1