| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j1205_1-unsat--soft-66-100-0.wbo |
| MD5SUM | b23d98b6a9e16ec7128727f044ea4649 |
| 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 | 17 |
| Best CPU time to get the best result obtained on this benchmark | 3.3095 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 22264 |
| Total number of constraints | 70239 |
| Number of soft constraints | 23796 |
| Number of constraints which are clauses | 69875 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 364 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 34 |
| Top cost | 1198419 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1198418 |
| Biggest number in a constraint | 28 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 210 |
| 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 |
|---|---|---|---|---|
| Sat4j Resolution 2011-06-08 (complete) | 3492096 | OPTIMUM | 3.3095 | 2.03485 |
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: 17--too large--