Name | SuperSolutions/SuperSolutions-Taillard-os10/ SuperTaillard-os-10-12.xml |
MD5SUM | 5dc18f9bddc2dfff84e0f90fec56ce3b |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 24.9156 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 200 |
Number of constraints | 2800 |
Number of domains | 65 |
Minimum domain size | 520 |
Maximum domain size | 616 |
Distribution of domain sizes | [{"size":520,"count":2},{"size":521,"count":4},{"size":522,"count":2},{"size":523,"count":4},{"size":525,"count":4},{"size":527,"count":4},{"size":528,"count":2},{"size":529,"count":2},{"size":530,"count":6},{"size":531,"count":6},{"size":532,"count":2},{"size":534,"count":2},{"size":535,"count":2},{"size":536,"count":2},{"size":537,"count":2},{"size":541,"count":2},{"size":542,"count":4},{"size":543,"count":2},{"size":545,"count":4},{"size":547,"count":2},{"size":550,"count":2},{"size":551,"count":2},{"size":552,"count":2},{"size":553,"count":2},{"size":554,"count":2},"...",{"size":582,"count":6}, {"size":585,"count":4}, {"size":586,"count":2}, {"size":587,"count":2}, {"size":588,"count":2}, {"size":589,"count":4}, {"size":590,"count":2}, {"size":592,"count":2}, {"size":595,"count":4}, {"size":596,"count":2}, {"size":597,"count":2}, {"size":599,"count":2}, {"size":600,"count":6}, {"size":601,"count":2}, {"size":602,"count":2}, {"size":603,"count":2}, {"size":604,"count":6}, {"size":605,"count":2}, {"size":606,"count":2}, {"size":608,"count":4}, {"size":609,"count":2}, {"size":612,"count":4}, {"size":614,"count":6}, {"size":615,"count":4}, {"size":616,"count":4}] |
Minimum variable degree | 19 |
Maximum variable degree | 37 |
Distribution of variable degrees | [{"degree":19,"count":100},{"degree":37,"count":100}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":2800}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 2800 |
Distribution of constraint types | [{"type":"intension","count":2800}] |
Optimization problem | NO |
Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list>x0 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 x101 x102 x103 x104 x105 x106 x107 x108 x109 x110 x111 x112 x113 x114 x115 x116 x117 x118 x119 x120 x121 x122 x123 x124 x125 x126 x127 x128 x129 x130 x131 x132 x133 x134 x135 x136 x137 x138 x139 x140 x141 x142 x143 x144 x145 x146 x147 x148 x149 x150 x151 x152 x153 x154 x155 x156 x157 x158 x159 x160 x161 x162 x163 x164 x165 x166 x167 x168 x169 x170 x171 x172 x173 x174 x175 x176 x177 x178 x179 x180 x181 x182 x183 x184 x185 x186 x187 x188 x189 x190 x191 x192 x193 x194 x195 x196 x197 x198 x199</list> <values>0 1 486 487 207 208 188 189 151 152 252 253 330 331 586 587 99 100 387 388 173 174 404 405 440 441 291 292 91 92 492 493 586 587 0 1 486 605 521 522 521 522 381 382 154 155 194 195 244 245 46 47 90 91 291 292 341 342 469 470 515 516 96 97 346 347 278 279 176 177 0 1 443 444 565 566 595 596 440 441 403 405 248 249 523 524 0 1 272 273 15 16 335 336 208 494 74 75 152 153 209 210 0 1 46 47 111 112 259 260 340 341 387 388 439 514 518 519 584 585 174 175 264 265 0 1 57 58 345 346 386 387 397 398 404 405 480 481 523 524 18 19 105 106 174 175 208 209 291 292 383 384 471 478 503 504 591 592 606 607 0 1 18 19 96 97 144 145 147 148 152 153 212 213 272 273 387 388 591 592 0 1 37 38 96 97 120 121 209 210 228 229 286 287 346 347 456 457 503 504</values> </instantiation>