| Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf9.ucl--soft-33-100-0.wbo |
| MD5SUM | 16edd19565c435db1c6980c47a901d3a |
| 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 | 10.8723 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 11476 |
| Total number of constraints | 33090 |
| Number of soft constraints | 22107 |
| Number of constraints which are clauses | 32382 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 708 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 1114426 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1114425 |
| Biggest number in a constraint | 33 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 126 |
| Number of bits of the biggest sum of numbers | 7 |
| 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) | 3717836 | OPTIMUM | 10.8723 | 9.09097 |
| toysat 2012-05-17 (complete) | 3711758 | OPTIMUM | 92.4209 | 92.437 |
| npSolver inc (complete) | 3713962 | ? (TO) | 1800.03 | 1800.31 |
| npSolver inc-topdown-quickBound (complete) | 3715348 | ? (TO) | 1800.08 | 1800.61 |
| npSolver 1.0 (complete) | 3713269 | ? (TO) | 1800.08 | 1800.41 |
| wbo2sat 2012-05-19 (complete) | 3716041 | ? (TO) | 1800.09 | 1800.51 |
| wbo2satCp2 2012-05-19 (complete) | 3716734 | ? (TO) | 1800.09 | 1800.41 |
| npSolver 1.0 (fixed) (complete) | 3754729 | ? (TO) | 1800.11 | 1800.41 |
| npSolver inc-topDown (fixed) (complete) | 3753343 | ? (TO) | 1800.11 | 1800.41 |
| npSolver inc-topDown (complete) | 3714655 | ? (TO) | 1800.12 | 1800.41 |
| npSolver inc (fixed) (complete) | 3754036 | ? (TO) | 1800.12 | 1800.42 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752650 | ? (TO) | 1800.13 | 1800.41 |
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--