| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j301_4-unsat--soft-66-100-0.wbo |
| MD5SUM | 3c0ab74eb8c9db5a91042a699e6b4444 |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 21 |
| Best CPU time to get the best result obtained on this benchmark | 0.565913 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 3844 |
| Total number of constraints | 11854 |
| Number of soft constraints | 4065 |
| Number of constraints which are clauses | 11610 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 244 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 205056 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 205055 |
| Biggest number in a constraint | 15 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 99 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093452 | OPTIMUM | 0.565913 | 0.567975 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090680 | OPTIMUM | 1.3228 | 0.59944 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092066 | OPTIMUM | 4.11437 | 1.72349 |
| NaPS 1.02 (complete) | 4094838 | OPTIMUM | 26.014 | 26.0196 |
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: 21-x3841 -x3842 -x3843 x3844