| Name | /PARTIAL-BIGINT-LIN/wcsp/graphs/ normalized-graph13_wcsp.wbo |
| MD5SUM | 0e82f4b503d348a993f5f25b1601fee8 |
| 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 | 17588 |
| Total number of constraints | 2800426 |
| Number of soft constraints | 2799968 |
| Number of constraints which are clauses | 2799968 |
| Number of constraints which are cardinality constraints (but not clauses) | 458 |
| 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 | 1167526 |
| Min constraint cost | 1 |
| Max constraint cost | 1000 |
| Sum of constraints costs | 719469320 |
| 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) | 2701853 | UNSAT | 84.3872 | 49.2292 |
| PB/CT 0.1 fixed (complete) | 2701857 | ? (MO) | 31.1333 | 31.1331 |
| PB/CT 0.1 (complete) | 2701855 | ? (MO) | 33.6429 | 35.6464 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701852 | ? (TO) | 1800.13 | 1148.27 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701856 | ? (TO) | 1800.16 | 1759.9 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701854 | ? (TO) | 1800.27 | 1091.11 |
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: