| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j308_1-unsat--soft-66-100-0.wbo |
| MD5SUM | 4e0a136411b79a2ddcc8f753eeb43778 |
| 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 | 83 |
| Best CPU time to get the best result obtained on this benchmark | 0.019996 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 2728 |
| Total number of constraints | 8382 |
| Number of soft constraints | 2841 |
| Number of constraints which are clauses | 8210 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 172 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 17 |
| Top cost | 145413 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 145412 |
| Biggest number in a constraint | 32 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 143 |
| 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 |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448317 | OPTIMUM | 0.019996 | 0.021023 |
| wbo 1.6 (complete) | 3446705 | OPTIMUM | 0.022995 | 0.0242579 |
| Sat4j Resolution 2011-06-08 (complete) | 3492245 | OPTIMUM | 1.3418 | 0.61033 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447442 | OPTIMUM | 1.9777 | 1.97946 |
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: 83-x2724 -x2725 -x2726 -x2727 x2728