| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j60/ normalized-j6030_9-unsat--soft-33-100-0.wbo |
| MD5SUM | b7f7bf9a96b4a18a2b3361c5e215972e |
| 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 | 3.04354 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 11956 |
| Total number of constraints | 39426 |
| Number of soft constraints | 26435 |
| Number of constraints which are clauses | 39038 |
| 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 | 60 |
| Top cost | 1328063 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1328062 |
| Biggest number in a constraint | 33 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 416 |
| 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) | 3717856 | OPTIMUM | 3.04354 | 1.33213 |
| toysat 2012-05-17 (complete) | 3711778 | OPTIMUM | 90.4583 | 90.4792 |
| npSolver 1.0 (fixed) (complete) | 3754749 | ? (problem) | 1.62675 | 3.32028 |
| npSolver inc-topDown (fixed) (complete) | 3753363 | ? (problem) | 1.63475 | 3.48702 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752670 | ? (problem) | 1.63675 | 3.43008 |
| npSolver inc (fixed) (complete) | 3754056 | ? (problem) | 1.71074 | 3.8097 |
| npSolver inc-topdown-quickBound (complete) | 3715368 | ? (TO) | 1800.01 | 1800.81 |
| npSolver inc (complete) | 3713982 | ? (TO) | 1800.06 | 1800.62 |
| npSolver 1.0 (complete) | 3713289 | ? (TO) | 1800.08 | 1800.51 |
| wbo2sat 2012-05-19 (complete) | 3716061 | ? (TO) | 1800.1 | 1800.51 |
| wbo2satCp2 2012-05-19 (complete) | 3716754 | ? (TO) | 1800.1 | 1800.42 |
| npSolver inc-topDown (complete) | 3714675 | ? (TO) | 1800.12 | 1800.51 |
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--