Name | /PARTIAL-SMALLINT-LIN/wcsp/dimacs/ normalized-dubois25_ext.wbo |
MD5SUM | 02919f0a1a07fbe3a6686539defb1cd5 |
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.002998 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 150 |
Total number of constraints | 275 |
Number of soft constraints | 200 |
Number of constraints which are clauses | 200 |
Number of constraints which are cardinality constraints (but not clauses) | 75 |
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 | 201 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 200 |
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) | 3448662 | OPTIMUM | 0.002998 | 0.00583305 |
wbo 1.6 (complete) | 3447188 | OPTIMUM | 0.004999 | 0.0064171 |
Sat4j Resolution 2011-06-08 (complete) | 3492774 | OPTIMUM | 0.363944 | 0.233718 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447925 | OPTIMUM | 0.585909 | 0.58546 |
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 -x145 x146 -x147 x148 -x149 x150