| Name | SportsScheduling/ SportsScheduling-12_c18.xml |
| MD5SUM | 7e6479b2a75a5c904a12e855693ae1ca |
| 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 | 20.8911 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 210 |
| Number of constraints | 114 |
| Number of domains | 2 |
| Minimum domain size | 12 |
| Maximum domain size | 66 |
| Distribution of domain sizes | [{"size":12,"count":144},{"size":66,"count":66}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":72},{"degree":4,"count":138}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 66 |
| Distribution of constraint arities | [{"arity":1,"count":6},{"arity":2,"count":6},{"arity":3,"count":66},{"arity":6,"count":11},{"arity":12,"count":12},{"arity":22,"count":6},{"arity":24,"count":6},{"arity":66,"count":1}] |
| Number of extensional constraints | 66 |
| Number of intensional constraints | 12 |
| Distribution of constraint types | [{"type":"extension","count":66},{"type":"intension","count":12},{"type":"allDifferent","count":13},{"type":"count","count":11},{"type":"cardinality","count":12}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309117 | SAT | 20.8911 | 4.88602 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291348 | SAT | 21.3231 | 4.88813 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297761 | SAT | 53.0284 | 7.28618 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297026 | SAT | 150.712 | 23.732 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307210 | SAT | 247.599 | 36.8019 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307446 | SAT | 362.641 | 51.2182 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297262 | SAT | 444.489 | 60.7238 |
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[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[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[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[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[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] 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[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[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[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[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[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] 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[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[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[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[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[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] hd[0] hd[1] hd[2] hd[3] hd[4] hd[5] ad[0] ad[1] ad[2] ad[3] ad[4] ad[5] </list> <values> 0 9 7 3 0 2 6 3 2 1 6 2 4 1 1 8 5 0 6 0 5 3 4 5 9 8 1 1 4 0 3 2 2 6 3 5 7 2 4 1 2 4 0 0 8 1 2 0 3 0 5 1 5 3 7 10 0 0 6 4 3 2 4 1 7 1 1 11 11 5 5 8 10 9 7 4 8 3 10 8 2 10 11 7 11 9 9 4 5 7 10 11 9 7 11 8 6 6 10 7 8 6 10 11 9 3 5 8 10 11 9 6 4 4 7 6 8 10 10 11 9 11 2 3 9 6 10 9 7 11 8 5 0 64 59 31 4 26 54 35 25 13 52 21 43 17 11 61 50 6 55 8 48 30 38 46 63 62 18 16 44 7 32 24 28 51 34 45 58 29 42 12 23 41 9 10 60 15 22 3 33 5 47 19 49 37 57 65 1 2 53 39 36 27 40 20 56 14 4 6 0 1 2 5 10 7 3 9 11 8 </values> </instantiation>