| Name | TravelingTournament/ TravelingTournament-a3-galaxy06_c18.xml |
| MD5SUM | f9caa09a77a0aeed2ee1a5d5b0978ec8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1403 |
| Best CPU time to get the best result obtained on this benchmark | 20063.4 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 246 |
| Number of constraints | 485 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":2,"count":120},{"size":6,"count":60},{"size":16,"count":66}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":2,"count":126},{"degree":17,"count":48},{"degree":18,"count":60},{"degree":19,"count":10},{"degree":20,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":2,"count":61},{"arity":3,"count":12},{"arity":4,"count":216},{"arity":5,"count":54},{"arity":6,"count":70},{"arity":8,"count":60},{"arity":10,"count":12}] |
| Number of extensional constraints | 66 |
| Number of intensional constraints | 277 |
| Distribution of constraint types | [{"type":"extension","count":66},{"type":"intension","count":277},{"type":"regular","count":6},{"type":"allDifferent","count":10},{"type":"cardinality","count":6},{"type":"element","count":120}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291015 | SAT (TO) | 1395 | 20041.5 | 2520.3 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308784 | SAT (TO) | 1402 | 19997.1 | 2520.37 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297428 | SAT (TO) | 1403 | 20063.4 | 2520.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1395<instantiation> <list> o[0][0] o[0][1] o[0][2] o[0][3] o[0][4] o[0][5] o[0][6] o[0][7] o[0][8] o[0][9] o[1][0] o[1][1] o[1][2] o[1][3] o[1][4] o[1][5] o[1][6] o[1][7] o[1][8] o[1][9] o[2][0] o[2][1] o[2][2] o[2][3] o[2][4] o[2][5] o[2][6] o[2][7] o[2][8] o[2][9] o[3][0] o[3][1] o[3][2] o[3][3] o[3][4] o[3][5] o[3][6] o[3][7] o[3][8] o[3][9] o[4][0] o[4][1] o[4][2] o[4][3] o[4][4] o[4][5] o[4][6] o[4][7] o[4][8] o[4][9] o[5][0] o[5][1] o[5][2] o[5][3] o[5][4] o[5][5] o[5][6] o[5][7] o[5][8] o[5][9] 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[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[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[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[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[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] 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[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[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[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[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[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] t[0][0] t[0][1] t[0][2] t[0][3] t[0][4] t[0][5] t[0][6] t[0][7] t[0][8] t[0][9] t[0][10] t[1][0] t[1][1] t[1][2] t[1][3] t[1][4] t[1][5] t[1][6] t[1][7] t[1][8] t[1][9] t[1][10] t[2][0] t[2][1] t[2][2] t[2][3] t[2][4] t[2][5] t[2][6] t[2][7] t[2][8] t[2][9] t[2][10] t[3][0] t[3][1] t[3][2] t[3][3] t[3][4] t[3][5] t[3][6] t[3][7] t[3][8] t[3][9] t[3][10] t[4][0] t[4][1] t[4][2] t[4][3] t[4][4] t[4][5] t[4][6] t[4][7] t[4][8] t[4][9] t[4][10] t[5][0] t[5][1] t[5][2] t[5][3] t[5][4] t[5][5] t[5][6] t[5][7] t[5][8] t[5][9] t[5][10] </list> <values> 2 2 1 3 3 5 4 5 1 4 3 5 0 5 4 4 2 3 0 2 0 0 3 4 5 3 1 4 5 1 1 4 2 0 0 2 5 1 4 5 5 3 5 2 1 1 0 2 3 0 4 1 4 1 2 0 3 0 2 3 1 0 1 1 0 0 1 1 0 0 0 1 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 1 1 0 1 1 0 0 1 1 1 0 0 0 0 0 1 1 1 0 0 0 1 1 1 0 0 1 1 1 0 0 0 1 0 1 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0 0 1 1 1 0 0 0 1 1 0 0 0 1 1 1 0 0 15 15 0 34 41 39 0 10 31 36 32 32 10 39 35 31 22 22 0 0 0 15 15 0 45 35 41 47 0 0 22 22 0 0 47 15 34 0 0 32 31 35 41 35 41 51 0 0 31 10 15 45 0 0 0 40 31 35 0 0 41 34 15 50 0 </values> </instantiation>