| Name | AllInterval/AllInterval-m1-s1/ AllInterval-075.xml |
| MD5SUM | dfbde825bf319b4caa28116806ec8592 |
| 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 | 0.178818 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 149 |
| Number of constraints | 76 |
| Number of domains | 2 |
| Minimum domain size | 74 |
| Maximum domain size | 75 |
| Distribution of domain sizes | [{"size":74,"count":74},{"size":75,"count":75}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":76},{"degree":3,"count":73}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 75 |
| Distribution of constraint arities | [{"arity":3,"count":74},{"arity":74,"count":1},{"arity":75,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 74 |
| Distribution of constraint types | [{"type":"intension","count":74},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5-Hybrid (complete) | 4391547 | SAT | 0.178818 | 0.178925 |
| NACRE 1.0.5 (complete) | 4391747 | SAT | 0.180939 | 0.181241 |
| miniBTD 19.06.16 (complete) | 4391947 | SAT | 0.500684 | 0.502162 |
| cosoco 2.0 (complete) | 4397427 | ? (TO) | 2400.01 | 2400.5 |
| cosoco 2 (complete) | 4390147 | ? (TO) | 2400.01 | 2400.2 |
| cosoco 2.0 (complete) | 4408687 | ? (TO) | 2400.04 | 2400.01 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407589 | ? (TO) | 2400.08 | 2399.9 |
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] 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] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] y[20] y[21] y[22] y[23] y[24] y[25] y[26] y[27] y[28] y[29] y[30] y[31] y[32] y[33] y[34] y[35] y[36] y[37] y[38] y[39] y[40] y[41] y[42] y[43] y[44] y[45] y[46] y[47] y[48] y[49] y[50] y[51] y[52] y[53] y[54] y[55] y[56] y[57] y[58] y[59] y[60] y[61] y[62] y[63] y[64] y[65] y[66] y[67] y[68] y[69] y[70] y[71] y[72] y[73] </list> <values> 0 74 1 73 2 72 3 71 4 70 5 69 6 68 7 67 8 66 9 65 10 64 11 63 12 62 13 61 14 60 15 59 16 58 17 57 18 56 19 55 20 54 21 53 22 52 23 51 24 50 25 49 26 48 27 47 28 46 29 45 30 44 31 43 32 42 33 41 34 40 35 39 36 38 37 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 </values> </instantiation>