| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9028_2-unsat--soft-33-100-0.wbo |
| MD5SUM | 1096a1113afd2ce4c9ae102562d2176b |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 2.6146 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 13832 |
| Total number of constraints | 45398 |
| Number of soft constraints | 30404 |
| Number of constraints which are clauses | 45098 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 300 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 73 |
| Top cost | 1539905 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1539904 |
| Biggest number in a constraint | 68 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 479 |
| 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) | 3717862 | OPTIMUM | 2.6146 | 1.16147 |
| wbo2sat 2012-05-19 (complete) | 3716067 | OPTIMUM | 14.3118 | 14.3247 |
| wbo2satCp2 2012-05-19 (complete) | 3716760 | OPTIMUM | 14.7668 | 14.7804 |
| npSolver 1.0 (complete) | 3713295 | OPTIMUM | 35.7866 | 35.9084 |
| npSolver inc (complete) | 3713988 | OPTIMUM | 42.9065 | 43.0444 |
| toysat 2012-05-17 (complete) | 3711784 | OPTIMUM | 120.664 | 120.718 |
| npSolver inc-topDown (complete) | 3714681 | OPTIMUM | 617.658 | 618.736 |
| npSolver 1.0 (fixed) (complete) | 3754755 | ? (problem) | 1.9767 | 7.06807 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752676 | ? (problem) | 1.9827 | 8.19563 |
| npSolver inc-topDown (fixed) (complete) | 3753369 | ? (problem) | 1.9877 | 13.5896 |
| npSolver inc (fixed) (complete) | 3754062 | ? (problem) | 1.9897 | 9.34883 |
| npSolver inc-topdown-quickBound (complete) | 3715374 | ? (TO) | 1800.97 | 1884.32 |
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: 1--too large--