| Name | SportsScheduling/ SportsScheduling-08_c18.xml |
| MD5SUM | d342e5d3265d7d58fa84b10ce3b2f22d |
| 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.019931 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 92 |
| Number of constraints | 60 |
| Number of domains | 2 |
| Minimum domain size | 8 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":8,"count":64},{"size":28,"count":28}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":32},{"degree":4,"count":60}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 28 |
| Distribution of constraint arities | [{"arity":1,"count":4},{"arity":2,"count":4},{"arity":3,"count":28},{"arity":4,"count":7},{"arity":8,"count":8},{"arity":14,"count":4},{"arity":16,"count":4},{"arity":28,"count":1}] |
| Number of extensional constraints | 28 |
| Number of intensional constraints | 8 |
| Distribution of constraint types | [{"type":"extension","count":28},{"type":"intension","count":8},{"type":"allDifferent","count":9},{"type":"count","count":7},{"type":"cardinality","count":8}] |
| 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> h[0][0] h[0][1] h[0][2] h[0][3] h[0][4] h[0][5] h[0][6] h[1][0] h[1][1] h[1][2] h[1][3] h[1][4] h[1][5] h[1][6] h[2][0] h[2][1] h[2][2] h[2][3] h[2][4] h[2][5] h[2][6] h[3][0] h[3][1] h[3][2] h[3][3] h[3][4] h[3][5] h[3][6] a[0][0] a[0][1] a[0][2] a[0][3] a[0][4] a[0][5] a[0][6] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[1][6] a[2][0] a[2][1] a[2][2] a[2][3] a[2][4] a[2][5] a[2][6] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[3][5] a[3][6] m[0][0] m[0][1] m[0][2] m[0][3] m[0][4] m[0][5] m[0][6] m[1][0] m[1][1] m[1][2] m[1][3] m[1][4] m[1][5] m[1][6] m[2][0] m[2][1] m[2][2] m[2][3] m[2][4] m[2][5] m[2][6] m[3][0] m[3][1] m[3][2] m[3][3] m[3][4] m[3][5] m[3][6] hd[0] hd[1] hd[2] hd[3] ad[0] ad[1] ad[2] ad[3] </list> <values> 0 3 0 1 4 2 5 2 4 5 0 1 0 1 4 1 2 2 3 3 0 6 0 1 3 0 1 2 1 5 3 7 6 7 6 3 7 7 4 2 6 3 5 6 6 5 7 4 7 7 2 4 6 5 5 4 0 19 2 12 23 17 25 13 24 26 3 7 5 8 22 11 16 15 21 18 6 27 1 9 20 4 10 14 2 5 0 3 4 6 1 7 </values> </instantiation>