| Name | Random/Random-D-t035/ rand-2-40-16-250-035-86.xml |
| MD5SUM | 95e1ba6edeec6aa2d568f833deab6719 |
| 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 | 1.6602 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 250 |
| Number of domains | 1 |
| Minimum domain size | 16 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":16,"count":40}] |
| Minimum variable degree | 8 |
| Maximum variable degree | 19 |
| Distribution of variable degrees | [{"degree":8,"count":2},{"degree":9,"count":5},{"degree":10,"count":5},{"degree":11,"count":3},{"degree":12,"count":6},{"degree":13,"count":6},{"degree":14,"count":4},{"degree":15,"count":3},{"degree":16,"count":1},{"degree":17,"count":2},{"degree":18,"count":2},{"degree":19,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":250}] |
| Number of extensional constraints | 250 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":250}] |
| 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] x[35] x[36] x[37] x[38] x[39] </list> <values>12 5 15 5 14 11 0 9 5 9 5 7 4 9 0 0 14 15 10 10 15 15 10 7 0 3 9 1 7 4 0 1 15 5 5 15 6 8 12 14 </values> </instantiation>