| Name | /PARTIAL-SMALLINT-LIN/wcsp/dimacs/ normalized-bf2670-001_ext.wbo |
| MD5SUM | 8095d3cb426c703d90abfcd21e947104 |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 0.45093 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 2786 |
| Total number of constraints | 4827 |
| Number of soft constraints | 3434 |
| Number of constraints which are clauses | 3434 |
| Number of constraints which are cardinality constraints (but not clauses) | 1393 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 5 |
| Top cost | 3435 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 3434 |
| Biggest number in a constraint | 4 |
| Number of bits of the biggest number in a constraint | 3 |
| Biggest sum of numbers in a constraint | 9 |
| Number of bits of the biggest sum of numbers | 4 |
| 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) | 4093517 | OPTIMUM | 0.45093 | 0.452305 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090745 | OPTIMUM | 1.11583 | 0.522373 |
| NaPS 1.02 (complete) | 4094903 | OPTIMUM | 1.24581 | 1.24655 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092131 | OPTIMUM | 1.77373 | 1.46615 |
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: 1x2781 -x2782 x2783 -x2784 -x2785 x2786