| Name | /SOFT-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j308_1-unsat--soft-0-100-0.wbo |
| MD5SUM | 591706804da9a76ba42d2e694fd25fcb |
| Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 19 |
| Best CPU time to get the best result obtained on this benchmark | 1.13083 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 2728 |
| Total number of constraints | 8382 |
| Number of soft constraints | 8382 |
| Number of constraints which are clauses | 8210 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 172 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 17 |
| Top cost | 422384 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 422383 |
| Biggest number in a constraint | 32 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 143 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093060 | OPTIMUM | 1.13083 | 1.14109 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090288 | OPTIMUM | 1.36179 | 0.618718 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091674 | OPTIMUM | 3.53346 | 1.64266 |
| NaPS 1.02 (complete) | 4094446 | OPTIMUM | 43.2734 | 43.2832 |
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: 19-x2721 -x2722 -x2723 -x2724 -x2725 -x2726 -x2727 x2728