| Name | /SOFT-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12015_3-unsat--soft-0-100-0.wbo |
| MD5SUM | 038b251452359c1f04349e7ac28f0fb8 |
| 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 | 3 |
| Best CPU time to get the best result obtained on this benchmark | 40.5418 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 21054 |
| Total number of constraints | 66352 |
| Number of soft constraints | 66352 |
| Number of constraints which are clauses | 66008 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 344 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 93 |
| Top cost | 3337053 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 3337052 |
| Biggest number in a constraint | 46 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 599 |
| Number of bits of the biggest sum of numbers | 10 |
| 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) | 4093599 | OPTIMUM | 40.5418 | 40.5498 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090827 | OPTIMUM | 379.8 | 375.987 |
| NaPS 1.02 (complete) | 4094985 | MSAT (MO) | 93.3098 | 93.3246 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092213 | MSAT (TO) | 1800.58 | 940.364 |
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-x21051 -x21052 -x21053 x21054