| Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen06-16reduc_wcsp.wbo |
| MD5SUM | e51a1e905ff19ece48b75fd81968c4c3 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | |
| Best cost obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1921 |
| Total number of constraints | 124511 |
| Number of soft constraints | 124429 |
| Number of constraints which are clauses | 124429 |
| Number of constraints which are cardinality constraints (but not clauses) | 82 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 28 |
| Top cost | 3389 |
| Min constraint cost | 1 |
| Max constraint cost | 2436 |
| Sum of constraints costs | 44162576 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 29 |
| Number of bits of the biggest sum of numbers | 5 |
| 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 CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701361 | UNSAT | 4.73228 | 2.2572 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701360 | UNSAT | 18.3572 | 15.2901 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701362 | UNSAT | 22.8165 | 17.5859 |
| PB/CT 0.1 fixed (complete) | 2701365 | ? (TO) | 1800.08 | 1800.04 |
| PB/CT 0.1 (complete) | 2701363 | ? (TO) | 1800.08 | 1800.02 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701364 | ? (TO) | 1800.13 | 1798.07 |
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: