| Name | Tal/ Tal-02_c18.xml |
| MD5SUM | 66ad3cf55c90c9564165fed11cad25f4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 86 |
| Best CPU time to get the best result obtained on this benchmark | 28.3782 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 298 |
| Number of constraints | 217 |
| Number of domains | 9 |
| Minimum domain size | 1 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":1,"count":45},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":35},{"size":10,"count":21},{"size":42,"count":47}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":0,"count":128},{"degree":1,"count":45},{"degree":2,"count":37},{"degree":3,"count":7},{"degree":4,"count":8},{"degree":5,"count":19},{"degree":6,"count":15},{"degree":7,"count":11},{"degree":8,"count":11},{"degree":9,"count":8},{"degree":10,"count":5},{"degree":11,"count":3},{"degree":12,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":1,"count":69},{"arity":2,"count":68},{"arity":3,"count":23},{"arity":4,"count":9},{"arity":5,"count":14},{"arity":6,"count":13},{"arity":7,"count":11},{"arity":8,"count":8},{"arity":9,"count":2}] |
| Number of extensional constraints | 36 |
| Number of intensional constraints | 171 |
| Distribution of constraint types | [{"type":"extension","count":36},{"type":"intension","count":171},{"type":"count","count":10}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308912 | OPT | 86 | 14.1312 | 4.91293 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297556 | OPT | 86 | 28.3782 | 12.8375 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291143 | Wrong UNSAT | 3.49844 | 1.63686 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 86<instantiation> <list> c[0][0] c[0][1] c[0][2] c[0][3] c[0][4] c[0][5] c[1][0] c[1][1] c[1][2] c[1][3] c[1][4] c[1][5] c[2][0] c[2][1] c[2][2] c[2][3] c[2][4] c[2][5] c[3][0] c[3][1] c[3][2] c[3][3] c[3][4] c[3][5] c[4][0] c[4][1] c[4][2] c[4][3] c[4][4] c[4][5] c[5][0] c[5][1] c[5][2] c[5][3] c[5][4] c[5][5] c[6][0] c[6][1] c[6][2] c[6][3] c[6][4] c[6][5] c[7][0] c[7][1] c[7][2] c[7][3] c[7][4] c[7][5] c[8][0] c[8][1] c[8][2] c[8][3] c[8][4] c[8][5] c[9][0] c[9][1] c[9][2] c[9][3] c[9][4] c[9][5] c[10][0] c[10][1] c[10][2] c[10][3] c[10][4] c[10][5] c[11][0] c[11][1] c[11][2] c[11][3] c[11][4] c[11][5] l[0][0] l[0][1] l[0][2] l[0][3] l[0][4] l[0][5] l[1][0] l[1][1] l[1][2] l[1][3] l[1][4] l[1][5] l[2][0] l[2][1] l[2][2] l[2][3] l[2][4] l[2][5] l[3][0] l[3][1] l[3][2] l[3][3] l[3][4] l[4][0] l[4][1] l[4][2] l[4][3] l[4][4] l[5][0] l[5][1] l[5][2] l[5][3] l[6][0] l[6][1] l[6][2] l[6][3] l[7][0] l[7][1] l[7][2] l[8][0] l[8][1] l[8][2] l[9][0] l[9][1] l[10][0] l[10][1] l[11][0] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[5][0] a[5][1] a[5][2] a[5][3] a[7][0] a[7][1] a[7][2] a[9][0] a[9][1] a[11][0] i[2][0] i[2][1] i[2][2] i[2][3] i[2][4] i[2][5] i[4][0] i[4][1] i[4][2] i[4][3] i[4][4] i[6][0] i[6][1] i[6][2] i[6][3] i[8][0] i[8][1] i[8][2] i[10][0] i[10][1] cnt[0] cnt[1] cnt[2] cnt[3] cnt[4] cnt[5] cnt[6] cnt[7] cnt[8] cnt[9] </list> <values> 0 0 0 0 0 0 0 16 0 0 16 0 0 0 0 0 0 0 0 16 0 4 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 15 11 13 9 10 12 15 7 2 0 7 0 15 7 2 7 0 0 15 4 3 3 0 15 4 3 3 0 15 4 0 3 15 4 3 0 15 4 0 15 4 0 6 0 6 0 6 1 1 2 0 2 0 1 1 1 1 0 1 2 0 1 1 2 0 2 0 1 0 1 2 4 5 5 0 1 2 3 4 0 1 3 3 0 1 2 0 1 2 2 1 1 1 1 1 1 1 1 </values> </instantiation>