| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12023_3-unsat--soft-33-100-0.wbo |
| MD5SUM | b714d3f434d598dffefda7bd58bad9a8 |
| 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 | 8 |
| Best CPU time to get the best result obtained on this benchmark | 4.41233 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 23958 |
| Total number of constraints | 79333 |
| Number of soft constraints | 53071 |
| Number of constraints which are clauses | 78941 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 392 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 38 |
| Top cost | 2687283 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2687282 |
| Biggest number in a constraint | 22 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 225 |
| 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) | 3492108 | OPTIMUM | 4.41233 | 3.277 |
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: 8--too large--