Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf9.ucl--soft-66-100-0.wbo |
MD5SUM | 436e932860314596b9609870688d381f |
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.440932 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 20445 |
Total number of constraints | 58444 |
Number of soft constraints | 19808 |
Number of constraints which are clauses | 56420 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 2024 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 1010028 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1010027 |
Biggest number in a constraint | 65 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 254 |
Number of bits of the biggest sum of numbers | 8 |
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 |
---|---|---|---|---|
wbo 1.6 (complete) | 3446561 | OPTIMUM | 0.440932 | 0.44245 |
Sat4j Resolution 2011-06-08 (complete) | 3492076 | OPTIMUM | 8.12676 | 6.7916 |
clasp 2.0-RC2 (complete) | 3448216 | OPTIMUM | 18.5512 | 18.5506 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447298 | MSAT (TO) | 1800.12 | 1800.13 |
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--too large--