| Name | AllInterval/AllInterval-m1-s1/ AllInterval-035.xml |
| MD5SUM | fe30f006f3af9f6842518347a037ed7d |
| 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.031203 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 69 |
| Number of constraints | 36 |
| Number of domains | 2 |
| Minimum domain size | 34 |
| Maximum domain size | 35 |
| Distribution of domain sizes | [{"size":34,"count":34},{"size":35,"count":35}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":36},{"degree":3,"count":33}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 35 |
| Distribution of constraint arities | [{"arity":3,"count":34},{"arity":34,"count":1},{"arity":35,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 34 |
| Distribution of constraint types | [{"type":"intension","count":34},{"type":"allDifferent","count":2}] |
| 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 type="solution"> <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] 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] </list> <values> 0 34 1 33 2 32 3 31 4 30 5 29 6 28 7 27 8 26 9 25 10 24 11 23 12 22 13 21 14 20 15 19 16 18 17 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>