| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j602_7-unsat--soft-66-100-0.wbo |
| MD5SUM | 542acc6a88f2f74cb83091764e7f930f |
| 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 | 3 |
| Best CPU time to get the best result obtained on this benchmark | 1.38979 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 6466 |
| Total number of constraints | 19939 |
| Number of soft constraints | 6819 |
| Number of constraints which are clauses | 19731 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 208 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 19 |
| Top cost | 347791 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 347790 |
| Biggest number in a constraint | 22 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 112 |
| 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) | 4093465 | OPTIMUM | 1.38979 | 1.39425 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090693 | OPTIMUM | 1.48177 | 0.675754 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092079 | OPTIMUM | 3.51247 | 2.02018 |
| NaPS 1.02 (complete) | 4094851 | OPTIMUM | 58.3341 | 58.3443 |
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: 3-x6461 -x6462 -x6463 -x6464 -x6465 x6466