| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9035_1-unsat--soft-33-100-0.wbo |
| MD5SUM | ad298ec3d1b23c2d09641db93f834dc3 |
| 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 | 2.37664 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 17836 |
| Total number of constraints | 61428 |
| Number of soft constraints | 41185 |
| Number of constraints which are clauses | 61040 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 388 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 25 |
| Top cost | 2080586 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2080585 |
| Biggest number in a constraint | 28 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 185 |
| 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 |
|---|---|---|---|---|
| wbo2satCp2 2012-05-19 (complete) | 3716761 | OPTIMUM | 2.37664 | 2.38065 |
| wbo2sat 2012-05-19 (complete) | 3716068 | OPTIMUM | 2.41663 | 2.41999 |
| Sat4j PB 2012-05-28 (complete) | 3717863 | OPTIMUM | 2.84357 | 1.29551 |
| npSolver 1.0 (fixed) (complete) | 3754756 | OPTIMUM | 6.10607 | 6.33098 |
| npSolver inc (fixed) (complete) | 3754063 | OPTIMUM | 6.11107 | 6.2224 |
| npSolver inc (complete) | 3713989 | OPTIMUM | 6.13607 | 6.13684 |
| npSolver 1.0 (complete) | 3713296 | OPTIMUM | 6.16306 | 6.16413 |
| npSolver inc-topDown (fixed) (complete) | 3753370 | OPTIMUM | 11.6742 | 11.7552 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752677 | OPTIMUM | 11.7282 | 11.926 |
| npSolver inc-topDown (complete) | 3714682 | OPTIMUM | 12.3401 | 12.512 |
| npSolver inc-topdown-quickBound (complete) | 3715375 | OPTIMUM | 12.4441 | 12.5869 |
| toysat 2012-05-17 (complete) | 3711785 | OPTIMUM | 226.524 | 226.576 |
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--