| Name | Langford/Langford-m1-k3/ Langford-3-35.xml |
| MD5SUM | d39bc1ef1e07e502cfee7f2819d89a2a |
| 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 | 46.1491 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 71 |
| Number of domains | 1 |
| Minimum domain size | 105 |
| Maximum domain size | 105 |
| Distribution of domain sizes | [{"size":105,"count":105}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":70},{"degree":3,"count":35}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 105 |
| Distribution of constraint arities | [{"arity":2,"count":70},{"arity":105,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 70 |
| Distribution of constraint types | [{"type":"intension","count":70},{"type":"allDifferent","count":1}] |
| 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>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[0][10] x[0][11] x[0][12] x[0][13] x[0][14] x[0][15] x[0][16] x[0][17] x[0][18] x[0][19] x[0][20] x[0][21] x[0][22] x[0][23] x[0][24] x[0][25] x[0][26] x[0][27] x[0][28] x[0][29] x[0][30] x[0][31] x[0][32] x[0][33] x[0][34] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[1][10] x[1][11] x[1][12] x[1][13] x[1][14] x[1][15] x[1][16] x[1][17] x[1][18] x[1][19] x[1][20] x[1][21] x[1][22] x[1][23] x[1][24] x[1][25] x[1][26] x[1][27] x[1][28] x[1][29] x[1][30] x[1][31] x[1][32] x[1][33] x[1][34] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[2][10] x[2][11] x[2][12] x[2][13] x[2][14] x[2][15] x[2][16] x[2][17] x[2][18] x[2][19] x[2][20] x[2][21] x[2][22] x[2][23] x[2][24] x[2][25] x[2][26] x[2][27] x[2][28] x[2][29] x[2][30] x[2][31] x[2][32] x[2][33] x[2][34]</list> <values>23 51 35 10 6 0 85 4 1 8 71 77 24 17 68 55 61 29 56 44 58 46 50 28 36 37 31 41 3 42 2 16 26 5 9 25 54 39 15 12 7 93 13 11 19 83 90 38 32 84 72 79 48 76 65 80 69 74 53 62 64 59 70 33 73 34 49 60 40 45 27 57 43 20 18 14 101 22 21 30 95 103 52 47 100 89 97 67 96 86 102 92 98 78 88 91 87 99 63 104 66 82 94 75 81</values> </instantiation>