| Name | TravelingTournament/ TravelingTournament-a3-galaxy04_c18.xml |
| MD5SUM | 2910b6ca557b5fda778b46d150d1cbb4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 416 |
| Best CPU time to get the best result obtained on this benchmark | 2.86755 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 155 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 7 |
| Distribution of domain sizes | [{"size":2,"count":48},{"size":4,"count":24},{"size":7,"count":28}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":2,"count":52},{"degree":11,"count":16},{"degree":12,"count":24},{"degree":13,"count":6},{"degree":14,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":25},{"arity":3,"count":8},{"arity":4,"count":70},{"arity":5,"count":20},{"arity":6,"count":32}] |
| Number of extensional constraints | 28 |
| Number of intensional constraints | 65 |
| Distribution of constraint types | [{"type":"extension","count":28},{"type":"intension","count":65},{"type":"regular","count":4},{"type":"allDifferent","count":6},{"type":"cardinality","count":4},{"type":"element","count":48}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 416<instantiation type="optimum" cost="416"> <list> o[0][0] o[0][1] o[0][2] o[0][3] o[0][4] o[0][5] o[1][0] o[1][1] o[1][2] o[1][3] o[1][4] o[1][5] o[2][0] o[2][1] o[2][2] o[2][3] o[2][4] o[2][5] o[3][0] o[3][1] o[3][2] o[3][3] o[3][4] o[3][5] h[0][0] h[0][1] h[0][2] h[0][3] h[0][4] h[0][5] h[1][0] h[1][1] h[1][2] h[1][3] h[1][4] h[1][5] h[2][0] h[2][1] h[2][2] h[2][3] h[2][4] h[2][5] h[3][0] h[3][1] h[3][2] h[3][3] h[3][4] h[3][5] a[0][0] a[0][1] a[0][2] a[0][3] a[0][4] a[0][5] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[2][0] a[2][1] a[2][2] a[2][3] a[2][4] a[2][5] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[3][5] t[0][0] t[0][1] t[0][2] t[0][3] t[0][4] t[0][5] t[0][6] t[1][0] t[1][1] t[1][2] t[1][3] t[1][4] t[1][5] t[1][6] t[2][0] t[2][1] t[2][2] t[2][3] t[2][4] t[2][5] t[2][6] t[3][0] t[3][1] t[3][2] t[3][3] t[3][4] t[3][5] t[3][6] </list> <values> 2 3 1 2 1 3 3 2 0 3 0 2 0 1 3 0 3 1 1 0 2 1 2 0 0 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 0 0 1 0 0 0 1 1 1 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 1 0 1 1 1 0 0 15 15 0 0 10 32 34 32 47 15 10 0 0 0 0 0 0 15 34 32 22 0 34 15 22 32 0 0 </values> </instantiation>