| Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.unbounded.all.ucl--soft-66-100-0.wbo |
| MD5SUM | 8a7b280af2f03093297f21c42e0139c3 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big 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 | 1352.12 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 84836 |
| Total number of constraints | 245062 |
| Number of soft constraints | 83464 |
| Number of constraints which are clauses | 233598 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 11464 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 15 |
| Top cost | 4203368 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 4203367 |
| Biggest number in a constraint | 129 |
| Number of bits of the biggest number in a constraint | 8 |
| Biggest sum of numbers in a constraint | 510 |
| Number of bits of the biggest sum of numbers | 9 |
| 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 |
|---|---|---|---|---|
| Sat4j Resolution 2011-06-08 (complete) | 3492051 | OPTIMUM | 1352.12 | 1349.99 |
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--