| Name | SportsScheduling/ SportsScheduling-10_c18.xml |
| MD5SUM | 90120b7f275ce51772dc9fcf00f05be5 |
| 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.052072 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 145 |
| Number of constraints | 85 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":10,"count":100},{"size":45,"count":45}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":50},{"degree":4,"count":95}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 45 |
| Distribution of constraint arities | [{"arity":1,"count":5},{"arity":2,"count":5},{"arity":3,"count":45},{"arity":5,"count":9},{"arity":10,"count":10},{"arity":18,"count":5},{"arity":20,"count":5},{"arity":45,"count":1}] |
| Number of extensional constraints | 45 |
| Number of intensional constraints | 10 |
| Distribution of constraint types | [{"type":"extension","count":45},{"type":"intension","count":10},{"type":"allDifferent","count":11},{"type":"count","count":9},{"type":"cardinality","count":10}] |
| 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[0][7] h[0][8] h[1][0] h[1][1] h[1][2] h[1][3] h[1][4] h[1][5] h[1][6] h[1][7] h[1][8] h[2][0] h[2][1] h[2][2] h[2][3] h[2][4] h[2][5] h[2][6] h[2][7] h[2][8] h[3][0] h[3][1] h[3][2] h[3][3] h[3][4] h[3][5] h[3][6] h[3][7] h[3][8] h[4][0] h[4][1] h[4][2] h[4][3] h[4][4] h[4][5] h[4][6] h[4][7] h[4][8] a[0][0] a[0][1] a[0][2] a[0][3] a[0][4] a[0][5] a[0][6] a[0][7] a[0][8] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[1][6] a[1][7] a[1][8] a[2][0] a[2][1] a[2][2] a[2][3] a[2][4] a[2][5] a[2][6] a[2][7] a[2][8] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[3][5] a[3][6] a[3][7] a[3][8] a[4][0] a[4][1] a[4][2] a[4][3] a[4][4] a[4][5] a[4][6] a[4][7] a[4][8] m[0][0] m[0][1] m[0][2] m[0][3] m[0][4] m[0][5] m[0][6] m[0][7] m[0][8] m[1][0] m[1][1] m[1][2] m[1][3] m[1][4] m[1][5] m[1][6] m[1][7] m[1][8] m[2][0] m[2][1] m[2][2] m[2][3] m[2][4] m[2][5] m[2][6] m[2][7] m[2][8] m[3][0] m[3][1] m[3][2] m[3][3] m[3][4] m[3][5] m[3][6] m[3][7] m[3][8] m[4][0] m[4][1] m[4][2] m[4][3] m[4][4] m[4][5] m[4][6] m[4][7] m[4][8] hd[0] hd[1] hd[2] hd[3] hd[4] ad[0] ad[1] ad[2] ad[3] ad[4] </list> <values> 0 3 1 5 4 4 6 3 0 2 5 5 1 6 1 0 0 2 4 0 4 2 1 0 1 7 3 6 1 7 0 2 3 3 2 1 8 4 0 3 0 2 2 1 5 1 7 2 8 7 8 9 6 9 3 9 6 7 8 9 7 8 4 5 2 9 6 3 6 5 9 8 7 8 8 4 9 5 4 5 6 9 6 3 9 5 7 8 4 7 0 27 9 37 32 33 41 26 8 17 38 35 14 40 16 6 7 18 30 1 34 20 10 5 12 43 28 39 15 42 3 23 25 24 19 13 44 31 2 29 4 21 22 11 36 2 3 7 0 1 5 4 8 9 6 </values> </instantiation>