Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-11-10--soft-33-100-0.wbo |
MD5SUM | aee3c086893c0832e26f8cc2ef39e632 |
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.032994 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 110 |
Total number of constraints | 21 |
Number of soft constraints | 19 |
Number of constraints which are clauses | 11 |
Number of constraints which are cardinality constraints (but not clauses) | 10 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 10 |
Maximum length of a constraint | 11 |
Top cost | 810 |
Min constraint cost | 1 |
Max constraint cost | 83 |
Sum of constraints costs | 809 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 12 |
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 |
---|---|---|---|---|
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447439 | OPTIMUM | 0.032994 | 0.03493 |
clasp 2.0-RC2 (complete) | 3448314 | OPTIMUM | 62.7615 | 62.7621 |
wbo 1.6 (complete) | 3446702 | OPTIMUM | 84.9181 | 84.9208 |
Sat4j Resolution 2011-06-08 (complete) | 3492242 | OPTIMUM | 338.872 | 338.062 |
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-x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1