| Name | Langford/Langford-m1-k3/ Langford-3-45.xml |
| MD5SUM | c29e6924973099ab0a0c802e448a5f67 |
| 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 | 65.653 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 135 |
| Number of constraints | 91 |
| Number of domains | 1 |
| Minimum domain size | 135 |
| Maximum domain size | 135 |
| Distribution of domain sizes | [{"size":135,"count":135}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":90},{"degree":3,"count":45}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 135 |
| Distribution of constraint arities | [{"arity":2,"count":90},{"arity":135,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 90 |
| Distribution of constraint types | [{"type":"intension","count":90},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5-Hybrid (complete) | 4391465 | SAT | 65.653 | 65.6815 |
| NACRE 1.0.5 (complete) | 4391665 | SAT | 440.419 | 440.412 |
| miniBTD 19.06.16 (complete) | 4391865 | ? (TO) | 2400.01 | 2400.11 |
| cosoco 2.0 (complete) | 4408605 | ? (TO) | 2400.03 | 2399.7 |
| cosoco 2 (complete) | 4390065 | ? (TO) | 2400.03 | 2400.2 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407590 | ? (TO) | 2400.09 | 2399.91 |
| cosoco 2.0 (complete) | 4397345 | ? (TO) | 2400.11 | 2400.3 |
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[0][35] x[0][36] x[0][37] x[0][38] x[0][39] x[0][40] x[0][41] x[0][42] x[0][43] x[0][44] 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[1][35] x[1][36] x[1][37] x[1][38] x[1][39] x[1][40] x[1][41] x[1][42] x[1][43] x[1][44] 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] x[2][35] x[2][36] x[2][37] x[2][38] x[2][39] x[2][40] x[2][41] x[2][42] x[2][43] x[2][44] </list> <values> 129 124 3 80 98 114 46 100 102 81 2 9 106 42 0 52 1 20 4 6 75 5 12 34 65 41 55 67 33 45 15 66 40 8 17 13 18 10 21 23 29 30 38 25 31 131 127 7 85 104 121 54 109 112 92 14 22 120 57 16 69 19 39 24 27 97 28 36 59 91 68 83 96 63 76 47 99 74 43 53 50 56 49 61 64 71 73 82 70 77 133 130 11 90 110 128 62 118 122 103 26 35 134 72 32 86 37 58 44 48 119 51 60 84 117 95 111 125 93 107 79 132 108 78 89 87 94 88 101 105 113 116 126 115 123 </values> </instantiation>