Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-4queens_wcsp.wbo |
MD5SUM | 1d8258c22bc483b2975ac7eb72afa9f4 |
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 | 0 |
Best CPU time to get the best result obtained on this benchmark | 0.000999 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 16 |
Total number of constraints | 264 |
Number of soft constraints | 260 |
Number of constraints which are clauses | 260 |
Number of constraints which are cardinality constraints (but not clauses) | 4 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 4 |
Top cost | 1 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 260 |
Biggest number in a constraint | 3 |
Number of bits of the biggest number in a constraint | 2 |
Biggest sum of numbers in a constraint | 7 |
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) | 3448634 | OPTIMUM | 0.000999 | 0.00573402 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447897 | OPTIMUM | 0.042993 | 0.0432289 |
Sat4j Resolution 2011-06-08 (complete) | 3492746 | OPTIMUM | 0.224965 | 0.175513 |
wbo 1.6 (complete) | 3447160 | MSAT | 0.000999 | 0.00575489 |
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: 0-x1 x2 -x3 -x4 -x5 -x6 -x7 x8 x9 -x10 -x11 -x12 -x13 -x14 x15 -x16