| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12015_3-unsat--soft-33-100-0.wbo |
| MD5SUM | 0c296f9c06ec0d444dee5de3ba1f40ca |
| 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 | 5 |
| Best CPU time to get the best result obtained on this benchmark | 1065.78 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 21054 |
| Total number of constraints | 66352 |
| Number of soft constraints | 44341 |
| Number of constraints which are clauses | 66008 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 344 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 93 |
| Top cost | 2247790 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2247789 |
| Biggest number in a constraint | 46 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 599 |
| Number of bits of the biggest sum of numbers | 10 |
| 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) | 3492081 | OPTIMUM | 1065.78 | 1064.01 |
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: 5--too large--