Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-queen5-5-4_wcsp.wbo |
MD5SUM | aaeffaeae7d7089614c30e01f22ee722 |
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 | 12 |
Best CPU time to get the best result obtained on this benchmark | 1011.71 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 100 |
Total number of constraints | 665 |
Number of soft constraints | 640 |
Number of constraints which are clauses | 640 |
Number of constraints which are cardinality constraints (but not clauses) | 25 |
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 | 161 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 640 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
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 |
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: 12-x1 x2 -x3 -x4 -x5 -x6 -x7 x8 x9 -x10 -x11 -x12 -x13 -x14 -x15 x16 -x17 -x18 x19 -x20 -x21 -x22 x23 -x24 -x25 -x26 x27 -x28 -x29 x30 -x31 -x32 -x33 -x34 -x35 x36 x37 -x38 -x39 -x40 -x41 -x42 -x43 x44 x45 -x46 -x47 -x48 -x49 -x50 x51 -x52 -x53 -x54 x55 -x56 -x57 x58 -x59 -x60 -x61 -x62 x63 -x64 -x65 x66 -x67 -x68 -x69 -x70 -x71 x72 x73 -x74 -x75 -x76 x77 -x78 -x79 -x80 x81 -x82 -x83 -x84 -x85 x86 -x87 -x88 -x89 -x90 x91 -x92 -x93 x94 -x95 -x96 -x97 -x98 -x99 x100