| Name | /PARTIAL-BIGINT-LIN/wcsp/mprime/ normalized-mprime03c_wcsp.wbo |
| MD5SUM | 5c7268e89ad7dac71239c46ba08a4c41 |
| 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 | 278 |
| Best CPU time to get the best result obtained on this benchmark | 0.070988 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 139 |
| Total number of constraints | 747 |
| Number of soft constraints | 698 |
| Number of constraints which are clauses | 698 |
| Number of constraints which are cardinality constraints (but not clauses) | 49 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 10 |
| Top cost | 4227 |
| Min constraint cost | 1 |
| Max constraint cost | 4227 |
| Sum of constraints costs | 2750768 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 11 |
| Number of bits of the biggest sum of numbers | 4 |
| 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 |
|---|---|---|---|---|
| toysat 2012-05-17 (complete) | 3711864 | OPTIMUM | 0.070988 | 0.071786 |
| Sat4j PB 2012-05-28 (complete) | 3717942 | OPTIMUM | 0.302953 | 0.216852 |
| wbo2satCp2 2012-05-19 (complete) | 3716840 | OPTIMUM | 0.679896 | 0.688461 |
| wbo2sat 2012-05-19 (complete) | 3716147 | OPTIMUM | 0.692894 | 0.702786 |
| npSolver 1.0 (complete) | 3713375 | OPTIMUM | 0.778881 | 0.783291 |
| npSolver inc (complete) | 3714068 | OPTIMUM | 0.785879 | 0.800094 |
| npSolver 1.0 (fixed) (complete) | 3754835 | OPTIMUM | 1.9847 | 1.97927 |
| npSolver inc (fixed) (complete) | 3754142 | OPTIMUM | 2.01169 | 2.00902 |
| npSolver inc-topDown (fixed) (complete) | 3753449 | OPTIMUM | 13.9869 | 13.9851 |
| npSolver inc-topDown (complete) | 3714761 | OPTIMUM | 15.5676 | 15.6443 |
| npSolver inc-topdown-quickBound (complete) | 3715454 | ? (TO) | 1800.11 | 1813.52 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752756 | ? (TO) | 1800.15 | 1814.12 |
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: 278x131 x132 -x133 x134 -x135 -x136 x137 x138 -x139