| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9012_2-unsat--soft-33-100-0.wbo |
| MD5SUM | dad192078946e4e501b7d3b25da46ada |
| 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 | 11 |
| Best CPU time to get the best result obtained on this benchmark | 2.41463 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 12922 |
| Total number of constraints | 40512 |
| Number of soft constraints | 27111 |
| Number of constraints which are clauses | 40232 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 280 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 69 |
| Top cost | 1376604 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1376603 |
| Biggest number in a constraint | 102 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 504 |
| 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) | 3717859 | OPTIMUM | 2.41463 | 1.1012 |
| toysat 2012-05-17 (complete) | 3711781 | OPTIMUM | 95.0386 | 95.0676 |
| wbo2sat 2012-05-19 (complete) | 3716064 | OPTIMUM | 922.405 | 923.046 |
| npSolver inc (complete) | 3713985 | OPTIMUM | 964.99 | 966.068 |
| npSolver 1.0 (complete) | 3713292 | OPTIMUM | 1033.82 | 1034.33 |
| wbo2satCp2 2012-05-19 (complete) | 3716757 | OPTIMUM | 1242.81 | 1243.29 |
| npSolver inc-topDown (fixed) (complete) | 3753366 | ? (problem) | 1.9717 | 4.73201 |
| npSolver inc (fixed) (complete) | 3754059 | ? (problem) | 1.9917 | 5.87166 |
| npSolver 1.0 (fixed) (complete) | 3754752 | ? (problem) | 1.9937 | 7.54998 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752673 | ? (problem) | 2.05569 | 7.31231 |
| npSolver inc-topDown (complete) | 3714678 | ? (TO) | 1800.03 | 1800.72 |
| npSolver inc-topdown-quickBound (complete) | 3715371 | ? (TO) | 1800.2 | 1772.02 |
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: 11--too large--