| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf9.ucl--soft-66-100-0.wbo |
| MD5SUM | b9fa744ec68633cb4114d71740485b31 |
| 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 | 1.16482 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 11476 |
| Total number of constraints | 33090 |
| Number of soft constraints | 11224 |
| Number of constraints which are clauses | 32382 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 708 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 569299 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 569298 |
| Biggest number in a constraint | 33 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 126 |
| 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 |
|---|---|---|---|---|
| wbo 1.6 (complete) | 3446619 | OPTIMUM | 1.16482 | 1.16619 |
| clasp 2.0-RC2 (complete) | 3448247 | OPTIMUM | 2.53561 | 2.53792 |
| Sat4j Resolution 2011-06-08 (complete) | 3492159 | OPTIMUM | 65.887 | 64.2697 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447356 | MSAT (TO) | 1800.3 | 1800.25 |
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--