Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-27-a4.xml |
MD5SUM | 4a6b886165f8d6d7f8f178d50db8a3de |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 857 |
Best CPU time to get the best result obtained on this benchmark | 1920.78 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 27 |
Number of constraints | 58502 |
Number of domains | 1 |
Minimum domain size | 1001 |
Maximum domain size | 1001 |
Distribution of domain sizes | [{"size":1001,"count":27}] |
Minimum variable degree | 8451 |
Maximum variable degree | 8452 |
Distribution of variable degrees | [{"degree":8451,"count":25},{"degree":8452,"count":2}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 27 |
Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":5850},{"arity":4,"count":52650},{"arity":27,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 58501 |
Distribution of constraint types | [{"type":"intension","count":58501},{"type":"ordered","count":1}] |
Optimization problem | YES |
Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 857<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] </list> <values> 0 26 125 166 214 254 328 389 445 499 565 597 632 684 708 733 754 776 792 812 826 839 845 849 854 856 857 </values> </instantiation>