| Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen07_wcsp.wbo |
| MD5SUM | df1c90215af2cae95a5e30d22d51f060 |
| 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 | 7976 |
| Total number of constraints | 1810140 |
| Number of soft constraints | 1809940 |
| Number of constraints which are clauses | 1809940 |
| Number of constraints which are cardinality constraints (but not clauses) | 200 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 44 |
| Top cost | 468527294 |
| Min constraint cost | 1 |
| Max constraint cost | 1000000 |
| Sum of constraints costs | 286472940853 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 45 |
| Number of bits of the biggest sum of numbers | 6 |
| 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) | 2701367 | UNSAT | 57.2853 | 26.5792 |
| PB/CT 0.1 (complete) | 2701369 | ? (MO) | 26.336 | 28.3363 |
| PB/CT 0.1 fixed (complete) | 2701371 | ? (MO) | 26.631 | 28.6356 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701366 | ? (TO) | 1800.07 | 1179.87 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701370 | ? (TO) | 1800.32 | 1769.1 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701368 | ? (TO) | 1800.33 | 1035.83 |
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: