| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j60/ normalized-j6033_2-unsat--soft-33-100-0.wbo |
| MD5SUM | f53b47c8da57e8203b6ddda55aa63e31 |
| 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 | 23 |
| Best CPU time to get the best result obtained on this benchmark | 3.53046 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 12200 |
| Total number of constraints | 42056 |
| Number of soft constraints | 28257 |
| Number of constraints which are clauses | 41660 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 396 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 18 |
| Top cost | 1425422 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1425421 |
| Biggest number in a constraint | 13 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 116 |
| Number of bits of the biggest sum of numbers | 7 |
| 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 Resolution 2.2.1 (complete) | 2698137 | OPTIMUM | 3.53046 | 3.5145 |
| PB/CT 0.1 fixed (complete) | 2698878 | MSAT (TO) | 1800.07 | 1800.02 |
| PB/CT 0.1 (complete) | 2695096 | Signal | 0.479926 | 0.480375 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691694 | Wrong UNSAT | 0.865867 | 0.462791 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690953 | Wrong UNSAT | 0.873866 | 0.462882 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694355 | Wrong UNSAT | 1.34479 | 0.618533 |
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: 23--too large--