| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9035_1-unsat--soft-33-100-0.wbo |
| MD5SUM | ad298ec3d1b23c2d09641db93f834dc3 |
| 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 | 8 |
| Best CPU time to get the best result obtained on this benchmark | 4.53531 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 17836 |
| Total number of constraints | 61428 |
| Number of soft constraints | 41185 |
| Number of constraints which are clauses | 61040 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 388 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 25 |
| Top cost | 2080586 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2080585 |
| Biggest number in a constraint | 28 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 185 |
| Number of bits of the biggest sum of numbers | 8 |
| 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) | 2698109 | OPTIMUM | 4.53531 | 3.12749 |
| PB/CT 0.1 fixed (complete) | 2698850 | MSAT (TO) | 1800.05 | 1800.02 |
| PB/CT 0.1 (complete) | 2695068 | Signal | 0.45393 | 0.456744 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691666 | Wrong UNSAT | 2.32065 | 1.1465 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690925 | Wrong UNSAT | 3.12652 | 1.66035 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694327 | Wrong UNSAT | 5.61115 | 2.91631 |
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: 8--too large--