| Name | Random/Random-B-2-26-26/ rand-2-26-26-325-155-9.xml |
| MD5SUM | 15e1cc79eec027fdb50c97913c9f3702 |
| 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 | 13.4974 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 26 |
| Number of constraints | 325 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":26}] |
| Minimum variable degree | 25 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":25,"count":26}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":325}] |
| Number of extensional constraints | 325 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":325}] |
| 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] </list> <values>22 21 16 10 23 18 23 12 6 24 19 17 22 18 3 12 3 3 19 2 3 3 8 9 24 0 </values> </instantiation>