| Name | SportsScheduling/ SportsScheduling-14_c18.xml |
| MD5SUM | 1e3f519c957d5cb55b89b746c42a86fa |
| 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 | 107.645 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 287 |
| Number of constraints | 147 |
| Number of domains | 2 |
| Minimum domain size | 14 |
| Maximum domain size | 91 |
| Distribution of domain sizes | [{"size":14,"count":196},{"size":91,"count":91}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":98},{"degree":4,"count":189}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 91 |
| Distribution of constraint arities | [{"arity":1,"count":7},{"arity":2,"count":7},{"arity":3,"count":91},{"arity":7,"count":13},{"arity":14,"count":14},{"arity":26,"count":7},{"arity":28,"count":7},{"arity":91,"count":1}] |
| Number of extensional constraints | 91 |
| Number of intensional constraints | 14 |
| Distribution of constraint types | [{"type":"extension","count":91},{"type":"intension","count":14},{"type":"allDifferent","count":15},{"type":"count","count":13},{"type":"cardinality","count":14}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291349 | SAT | 107.645 | 16.1575 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309118 | SAT | 109.042 | 16.3105 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307211 | SAT | 536.319 | 77.3472 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297263 | SAT | 1294.73 | 171.66 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307447 | SAT | 1412.83 | 187.283 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297027 | SAT | 2479.36 | 320.514 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297762 | ? (TO) | 19945.2 | 2520.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <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[0][9] h[0][10] h[0][11] h[0][12] 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[1][9] h[1][10] h[1][11] h[1][12] 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[2][9] h[2][10] h[2][11] h[2][12] 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[3][9] h[3][10] h[3][11] h[3][12] 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] h[4][9] h[4][10] h[4][11] h[4][12] h[5][0] h[5][1] h[5][2] h[5][3] h[5][4] h[5][5] h[5][6] h[5][7] h[5][8] h[5][9] h[5][10] h[5][11] h[5][12] h[6][0] h[6][1] h[6][2] h[6][3] h[6][4] h[6][5] h[6][6] h[6][7] h[6][8] h[6][9] h[6][10] h[6][11] h[6][12] 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[0][9] a[0][10] a[0][11] a[0][12] 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[1][9] a[1][10] a[1][11] a[1][12] 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[2][9] a[2][10] a[2][11] a[2][12] 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[3][9] a[3][10] a[3][11] a[3][12] 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] a[4][9] a[4][10] a[4][11] a[4][12] a[5][0] a[5][1] a[5][2] a[5][3] a[5][4] a[5][5] a[5][6] a[5][7] a[5][8] a[5][9] a[5][10] a[5][11] a[5][12] a[6][0] a[6][1] a[6][2] a[6][3] a[6][4] a[6][5] a[6][6] a[6][7] a[6][8] a[6][9] a[6][10] a[6][11] a[6][12] 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[0][9] m[0][10] m[0][11] m[0][12] 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[1][9] m[1][10] m[1][11] m[1][12] 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[2][9] m[2][10] m[2][11] m[2][12] 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[3][9] m[3][10] m[3][11] m[3][12] 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] m[4][9] m[4][10] m[4][11] m[4][12] m[5][0] m[5][1] m[5][2] m[5][3] m[5][4] m[5][5] m[5][6] m[5][7] m[5][8] m[5][9] m[5][10] m[5][11] m[5][12] m[6][0] m[6][1] m[6][2] m[6][3] m[6][4] m[6][5] m[6][6] m[6][7] m[6][8] m[6][9] m[6][10] m[6][11] m[6][12] hd[0] hd[1] hd[2] hd[3] hd[4] hd[5] hd[6] ad[0] ad[1] ad[2] ad[3] ad[4] ad[5] ad[6] </list> <values> 0 11 4 5 0 2 2 7 1 7 3 3 9 2 4 7 3 10 5 4 0 2 1 8 1 0 4 5 11 10 2 1 3 3 6 4 0 0 6 6 3 5 0 1 0 9 5 8 2 1 4 2 8 6 1 8 7 3 6 2 3 0 2 7 1 10 1 2 1 8 9 0 6 0 5 4 5 3 12 0 0 9 4 4 1 1 7 3 6 2 5 1 13 10 6 5 10 12 11 4 8 9 6 12 3 12 9 7 12 11 13 8 11 6 10 9 13 5 7 12 13 9 7 8 13 10 9 11 12 8 7 10 8 4 3 6 10 9 13 13 12 11 7 9 9 13 12 13 12 11 4 5 10 5 10 11 11 8 6 2 11 13 7 12 9 12 7 13 4 13 2 3 11 6 8 5 10 12 11 13 8 10 0 89 51 55 4 32 34 73 15 70 41 38 83 25 53 71 39 86 60 54 7 33 17 77 20 12 46 56 88 87 31 18 40 45 66 50 10 11 64 63 42 57 3 14 5 81 58 80 35 23 52 29 76 65 24 79 75 44 67 26 37 9 27 72 22 85 19 28 13 78 84 6 68 8 61 48 62 36 90 1 2 82 47 49 16 21 74 43 69 30 59 8 5 1 11 0 3 7 13 6 2 12 4 10 9 </values> </instantiation>