Name | Tal/ Tal-03_c18.xml |
MD5SUM | fb5ba5d4d49d61a1ee3ee3c25fa47163 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 96 |
Best CPU time to get the best result obtained on this benchmark | 175.687 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 404 |
Number of constraints | 286 |
Number of domains | 10 |
Minimum domain size | 1 |
Maximum domain size | 42 |
Distribution of domain sizes | [{"size":1,"count":63},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":43},{"size":7,"count":9},{"size":8,"count":28},{"size":42,"count":62}] |
Minimum variable degree | 0 |
Maximum variable degree | 13 |
Distribution of variable degrees | [{"degree":0,"count":177},{"degree":1,"count":63},{"degree":2,"count":47},{"degree":3,"count":8},{"degree":4,"count":9},{"degree":5,"count":25},{"degree":6,"count":17},{"degree":7,"count":12},{"degree":8,"count":12},{"degree":9,"count":17},{"degree":10,"count":8},{"degree":11,"count":5},{"degree":12,"count":3},{"degree":13,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 10 |
Distribution of constraint arities | [{"arity":1,"count":88},{"arity":2,"count":90},{"arity":3,"count":30},{"arity":4,"count":10},{"arity":5,"count":16},{"arity":6,"count":15},{"arity":7,"count":14},{"arity":8,"count":12},{"arity":9,"count":9},{"arity":10,"count":2}] |
Number of extensional constraints | 49 |
Number of intensional constraints | 225 |
Distribution of constraint types | [{"type":"extension","count":49},{"type":"intension","count":225},{"type":"count","count":12}] |
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) | 4308913 | OPT | 96 | 49.8952 | 9.24694 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297557 | OPT | 96 | 175.687 | 57.1694 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291144 | Wrong UNSAT | 4.08542 | 1.74918 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 96<instantiation> <list> c[0][0] c[0][1] c[0][2] c[0][3] c[0][4] c[0][5] c[0][6] c[1][0] c[1][1] c[1][2] c[1][3] c[1][4] c[1][5] c[1][6] c[2][0] c[2][1] c[2][2] c[2][3] c[2][4] c[2][5] c[2][6] c[3][0] c[3][1] c[3][2] c[3][3] c[3][4] c[3][5] c[3][6] c[4][0] c[4][1] c[4][2] c[4][3] c[4][4] c[4][5] c[4][6] c[5][0] c[5][1] c[5][2] c[5][3] c[5][4] c[5][5] c[5][6] c[6][0] c[6][1] c[6][2] c[6][3] c[6][4] c[6][5] c[6][6] c[7][0] c[7][1] c[7][2] c[7][3] c[7][4] c[7][5] c[7][6] c[8][0] c[8][1] c[8][2] c[8][3] c[8][4] c[8][5] c[8][6] c[9][0] c[9][1] c[9][2] c[9][3] c[9][4] c[9][5] c[9][6] c[10][0] c[10][1] c[10][2] c[10][3] c[10][4] c[10][5] c[10][6] c[11][0] c[11][1] c[11][2] c[11][3] c[11][4] c[11][5] c[11][6] c[12][0] c[12][1] c[12][2] c[12][3] c[12][4] c[12][5] c[12][6] c[13][0] c[13][1] c[13][2] c[13][3] c[13][4] c[13][5] c[13][6] l[0][0] l[0][1] l[0][2] l[0][3] l[0][4] l[0][5] l[0][6] l[1][0] l[1][1] l[1][2] l[1][3] l[1][4] l[1][5] l[1][6] l[2][0] l[2][1] l[2][2] l[2][3] l[2][4] l[2][5] l[2][6] l[3][0] l[3][1] l[3][2] l[3][3] l[3][4] l[3][5] l[4][0] l[4][1] l[4][2] l[4][3] l[4][4] l[4][5] l[5][0] l[5][1] l[5][2] l[5][3] l[5][4] l[6][0] l[6][1] l[6][2] l[6][3] l[6][4] l[7][0] l[7][1] l[7][2] l[7][3] l[8][0] l[8][1] l[8][2] l[8][3] l[9][0] l[9][1] l[9][2] l[10][0] l[10][1] l[10][2] l[11][0] l[11][1] l[12][0] l[12][1] l[13][0] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[1][6] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[3][5] a[5][0] a[5][1] a[5][2] a[5][3] a[5][4] a[7][0] a[7][1] a[7][2] a[7][3] a[9][0] a[9][1] a[9][2] a[11][0] a[11][1] a[13][0] i[2][0] i[2][1] i[2][2] i[2][3] i[2][4] i[2][5] i[2][6] i[4][0] i[4][1] i[4][2] i[4][3] i[4][4] i[4][5] i[6][0] i[6][1] i[6][2] i[6][3] i[6][4] i[8][0] i[8][1] i[8][2] i[8][3] i[10][0] i[10][1] i[10][2] i[12][0] i[12][1] cnt[0] cnt[1] cnt[2] cnt[3] cnt[4] cnt[5] cnt[6] cnt[7] cnt[8] cnt[9] cnt[10] cnt[11] </list> <values> 0 0 0 0 0 0 0 0 16 0 0 4 16 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 16 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 10 12 13 4 16 8 9 7 0 13 5 4 3 9 7 13 5 4 3 0 9 7 13 8 0 3 9 7 13 8 3 0 7 7 13 3 3 7 7 13 3 3 7 7 2 0 7 7 2 0 4 4 3 4 4 3 6 0 6 0 6 1 2 0 1 1 1 1 1 1 1 2 0 1 1 1 1 1 1 1 1 3 0 1 1 1 3 0 1 0 1 3 4 5 6 6 0 1 2 3 5 5 0 1 2 3 4 0 1 2 3 0 1 2 0 1 1 1 1 1 0 0 1 1 0 0 1 1 </values> </instantiation>