Name | GolombRuler/GolombRuler-a3-s1/ GolombRuler-10-a3.xml |
MD5SUM | 1a91370fd3edda64a19224a97cd9d854 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 55 |
Best CPU time to get the best result obtained on this benchmark | 16.0207 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 110 |
Number of constraints | 48 |
Number of domains | 2 |
Minimum domain size | 500 |
Maximum domain size | 501 |
Distribution of domain sizes | [{"size":500,"count":45},{"size":501,"count":10}] |
Minimum variable degree | 0 |
Maximum variable degree | 11 |
Distribution of variable degrees | [{"degree":0,"count":55},{"degree":2,"count":45},{"degree":10,"count":8},{"degree":11,"count":2}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 45 |
Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":45},{"arity":10,"count":1},{"arity":45,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 46 |
Distribution of constraint types | [{"type":"intension","count":46},{"type":"allDifferent","count":1},{"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: 55<instantiation> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[0][9] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[1][9] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[5][6] y[5][7] y[5][8] y[5][9] y[6][7] y[6][8] y[6][9] y[7][8] y[7][9] y[8][9] </list> <values>0 1 6 10 23 26 34 41 53 55 1 6 10 23 26 34 41 53 55 5 9 22 25 33 40 52 54 4 17 20 28 35 47 49 13 16 24 31 43 45 3 11 18 30 32 8 15 27 29 7 19 21 12 14 2 </values> </instantiation>