| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12026_5-unsat--soft-33-100-0.wbo |
| MD5SUM | 03b08701e36df5e014168edc711c28ff |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MSAT |
| Best cost obtained on this benchmark | 3411 |
| Best CPU time to get the best result obtained on this benchmark | 1800.28 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 32912 |
| Total number of constraints | 109848 |
| Number of soft constraints | 73680 |
| Number of constraints which are clauses | 109308 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 540 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 66 |
| Top cost | 3699128 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 3699127 |
| Biggest number in a constraint | 18 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 428 |
| Number of bits of the biggest sum of numbers | 9 |
| 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 |
|---|---|---|---|---|
| PB/CT 0.1 fixed (complete) | 2698822 | MSAT (TO) | 1800.1 | 1800.05 |
| SAT4J PB Resolution 2.2.1 (complete) | 2698081 | MSAT (TO) | 1800.28 | 1800.19 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690897 | ? (TO) | 1800.22 | 1794.23 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691638 | ? (TO) | 1800.24 | 1695.44 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694299 | ? (TO) | 1800.33 | 885.519 |
| PB/CT 0.1 (complete) | 2695040 | Signal | 1.87671 | 1.87717 |
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: 60124--too large--