| Name | /PARTIAL-SMALLINT-LIN/wcsp/dimacs/ normalized-dubois24_ext.wbo |
| MD5SUM | d95d50ba8d1bdae11ba3842427c410b2 |
| 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.002999 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 144 |
| Total number of constraints | 264 |
| Number of soft constraints | 192 |
| Number of constraints which are clauses | 192 |
| Number of constraints which are cardinality constraints (but not clauses) | 72 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 3 |
| Top cost | 193 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 192 |
| Biggest number in a constraint | 2 |
| Number of bits of the biggest number in a constraint | 2 |
| Biggest sum of numbers in a constraint | 5 |
| Number of bits of the biggest sum of numbers | 3 |
| 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 |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448647 | OPTIMUM | 0.002999 | 0.00578292 |
| wbo 1.6 (complete) | 3447173 | OPTIMUM | 0.005999 | 0.0068791 |
| Sat4j Resolution 2011-06-08 (complete) | 3492759 | OPTIMUM | 0.371943 | 0.230559 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447910 | OPTIMUM | 0.576911 | 0.577868 |
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: 1x138 -x139 x140 -x141 x142 -x143 x144