| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j907_8-unsat--soft-33-100-0.wbo |
| MD5SUM | 4e95d2f358a1d03e64dd8ae41095cef7 |
| 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 | 2 |
| Best CPU time to get the best result obtained on this benchmark | 2.26366 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 10920 |
| Total number of constraints | 34033 |
| Number of soft constraints | 22812 |
| Number of constraints which are clauses | 33797 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 236 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 50 |
| Top cost | 1153249 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1153248 |
| Biggest number in a constraint | 60 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 345 |
| Number of bits of the biggest sum of numbers | 9 |
| 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 PB 2012-05-28 (complete) | 3717868 | OPTIMUM | 2.26366 | 1.01102 |
| toysat 2012-05-17 (complete) | 3711790 | OPTIMUM | 66.7798 | 66.7906 |
| npSolver 1.0 (complete) | 3713301 | OPTIMUM | 119.745 | 119.874 |
| npSolver inc (complete) | 3713994 | OPTIMUM | 120.114 | 120.147 |
| wbo2satCp2 2012-05-19 (complete) | 3716766 | OPTIMUM | 160.655 | 160.691 |
| wbo2sat 2012-05-19 (complete) | 3716073 | OPTIMUM | 162.314 | 162.348 |
| npSolver inc (fixed) (complete) | 3754068 | ? (problem) | 1.3328 | 3.96888 |
| npSolver 1.0 (fixed) (complete) | 3754761 | ? (problem) | 1.3388 | 2.49417 |
| npSolver inc-topDown (fixed) (complete) | 3753375 | ? (problem) | 1.35279 | 5.01718 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752682 | ? (problem) | 1.35979 | 2.71805 |
| npSolver inc-topDown (complete) | 3714687 | ? (TO) | 1800.12 | 1800.62 |
| npSolver inc-topdown-quickBound (complete) | 3715380 | ? (TO) | 1800.4 | 1870.52 |
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: 2--too large--