| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf10.ucl--soft-66-100-0.wbo |
| MD5SUM | 5805010aa07d3b134ea004b7ad815631 |
| 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 | 6.85596 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 18069 |
| Total number of constraints | 52475 |
| Number of soft constraints | 17765 |
| Number of constraints which are clauses | 51555 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 920 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 896785 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 896784 |
| Biggest number in a constraint | 39 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 132 |
| 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) | 3446693 | OPTIMUM | 6.85596 | 6.85664 |
| clasp 2.0-RC2 (complete) | 3448306 | OPTIMUM | 56.8594 | 56.8711 |
| Sat4j Resolution 2011-06-08 (complete) | 3492233 | OPTIMUM | 916.764 | 914.728 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447430 | MSAT (TO) | 1800.41 | 1800.38 |
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--