Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-55-50--soft-66-100-0.wbo |
MD5SUM | d7a0ad39836c923faf2776c1a468a22d |
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 | 9 |
Best CPU time to get the best result obtained on this benchmark | 0.186971 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 2750 |
Total number of constraints | 105 |
Number of soft constraints | 35 |
Number of constraints which are clauses | 55 |
Number of constraints which are cardinality constraints (but not clauses) | 50 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 50 |
Maximum length of a constraint | 55 |
Top cost | 1904 |
Min constraint cost | 1 |
Max constraint cost | 97 |
Sum of constraints costs | 1903 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 56 |
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) | 3447448 | OPTIMUM | 0.186971 | 0.187967 |
clasp 2.0-RC2 (complete) | 3448321 | MSAT (TO) | 1800.02 | 1800.01 |
Sat4j Resolution 2011-06-08 (complete) | 3492251 | MSAT (TO) | 1800.13 | 1796.27 |
wbo 1.6 (complete) | 3446711 | ? (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: 9-x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1