Name | /SOFT-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/ normalized-t2001.13queen13.1110974372--soft-0-100-0.wbo |
MD5SUM | 014e6d9d1387f6cdb0c56035ad106b75 |
Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 36 |
Best CPU time to get the best result obtained on this benchmark | 1.78473 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 169 |
Total number of constraints | 101 |
Number of soft constraints | 101 |
Number of constraints which are clauses | 30 |
Number of constraints which are cardinality constraints (but not clauses) | 70 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 169 |
Top cost | 5180 |
Min constraint cost | 1 |
Max constraint cost | 99 |
Sum of constraints costs | 5179 |
Biggest number in a constraint | 38 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 1266 |
Number of bits of the biggest sum of numbers | 11 |
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 |
---|---|---|---|---|
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447804 | OPTIMUM | 1.78473 | 1.78554 |
clasp 2.0-RC2 (complete) | 3448146 | OPTIMUM | 29.2256 | 29.2258 |
Sat4j Resolution 2011-06-08 (complete) | 3492653 | OPTIMUM | 171.299 | 169.887 |
wbo 1.6 (complete) | 3447067 | ? (TO) | 1800.05 | 1800.03 |
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: 36-x4 -x3 -x2 -x1