| Name | /SOFT-BIGINT-LIN/PB10/oliveras/j60/ normalized-j6033_2-unsat--soft-0-100-0.wbo |
| MD5SUM | 760a13c53343c1a6f431e5ddf8292a4c |
| Bench Category | SOFT-BIGINT-LIN (only soft constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 20 |
| Best CPU time to get the best result obtained on this benchmark | 2.19267 |
| 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 | 42056 |
| 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 | 2126290 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2126289 |
| 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 2.3.6 Resolution PB16 (complete) | 4090836 | OPTIMUM | 2.19267 | 1.09245 |
| toysat 2016-05-02 (complete) | 4093608 | OPTIMUM | 3.87041 | 3.87336 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092222 | OPTIMUM | 4.41333 | 2.35378 |
| NaPS 1.02 (complete) | 4094994 | MSAT | 110.143 | 110.161 |
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: 20--too large--