| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9048_1-unsat--soft-33-100-0.wbo |
| MD5SUM | b52f4371da43cfec5ed1cc41a72b95c0 |
| 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 | 10 |
| Best CPU time to get the best result obtained on this benchmark | 2.55261 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 15106 |
| Total number of constraints | 51743 |
| Number of soft constraints | 34693 |
| Number of constraints which are clauses | 51415 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 328 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 90 |
| Top cost | 1746055 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1746054 |
| Biggest number in a constraint | 105 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 658 |
| Number of bits of the biggest sum of numbers | 10 |
| 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) | 3717867 | OPTIMUM | 2.55261 | 1.18336 |
| wbo2sat 2012-05-19 (complete) | 3716072 | OPTIMUM | 22.2706 | 24.0536 |
| wbo2satCp2 2012-05-19 (complete) | 3716765 | OPTIMUM | 22.8985 | 26.4472 |
| npSolver inc (complete) | 3713993 | OPTIMUM | 55.5336 | 57.4487 |
| npSolver 1.0 (complete) | 3713300 | OPTIMUM | 55.6845 | 56.7237 |
| toysat 2012-05-17 (complete) | 3711789 | OPTIMUM | 158.152 | 158.191 |
| npSolver inc-topDown (complete) | 3714686 | OPTIMUM | 456.938 | 458.221 |
| npSolver inc-topdown-quickBound (complete) | 3715379 | OPTIMUM | 592.743 | 595.775 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752681 | ? (problem) | 2.49862 | 5.9277 |
| npSolver inc-topDown (fixed) (complete) | 3753374 | ? (problem) | 2.51562 | 12.0571 |
| npSolver inc (fixed) (complete) | 3754067 | ? (problem) | 2.53661 | 7.86341 |
| npSolver 1.0 (fixed) (complete) | 3754760 | ? (problem) | 2.54461 | 14.1764 |
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: 10--too large--