Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/ normalized-t2001.13queen13.1111226680--soft-66-100-0.wbo |
MD5SUM | dca485207caaa579309a7d2385685aa8 |
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 | 66 |
Best CPU time to get the best result obtained on this benchmark | 0.982849 |
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 | 28 |
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 | 1415 |
Min constraint cost | 1 |
Max constraint cost | 98 |
Sum of constraints costs | 1414 |
Biggest number in a constraint | 38 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 1190 |
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) | 3447530 | OPTIMUM | 0.982849 | 0.983932 |
clasp 2.0-RC2 (complete) | 3448397 | OPTIMUM | 1.9597 | 1.9602 |
Sat4j Resolution 2011-06-08 (complete) | 3492333 | OPTIMUM | 29.7915 | 28.9906 |
wbo 1.6 (complete) | 3446793 | OPTIMUM | 376.558 | 376.551 |
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: 66-x4 -x3 x2 -x1