| Name | PrizeCollecting/PrizeCollecting-jok-s1/ PrizeCollecting-25-5-5-0.xml |
| MD5SUM | 297e7ff3843a631e244fdcc6d730e090 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 41 |
| Best CPU time to get the best result obtained on this benchmark | 34.2796 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 75 |
| Number of constraints | 101 |
| Number of domains | 24 |
| Minimum domain size | 4 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":4,"count":12},{"size":5,"count":7},{"size":6,"count":6},{"size":26,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":2,"count":25},{"degree":26,"count":24},{"degree":27,"count":1},{"degree":28,"count":25}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 26 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":50},{"arity":25,"count":25},{"arity":26,"count":25}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 26 |
| Distribution of constraint types | [{"type":"extension","count":50},{"type":"intension","count":26},{"type":"count","count":25}] |
| Optimization problem | YES |
| Type of objective | max SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 41<instantiation type='solution' cost='41'> <list>g[0] g[10] g[11] g[12] g[13] g[14] g[15] g[16] g[17] g[18] g[19] g[1] g[20] g[21] g[22] g[23] g[24] g[2] g[3] g[4] g[5] g[6] g[7] g[8] g[9] p[0] p[10] p[11] p[12] p[13] p[14] p[15] p[16] p[17] p[18] p[19] p[1] p[20] p[21] p[22] p[23] p[24] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[1] s[20] s[21] s[22] s[23] s[24] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>-4 3 7 -6 7 2 0 3 3 6 4 6 0 0 0 0 0 6 -2 1 -3 0 -3 5 6 0 14 15 16 7 8 13 12 11 10 9 1 -1 -1 -1 -1 -1 2 3 4 19 18 17 6 5 1 11 12 7 14 19 10 15 16 17 18 2 -1 -1 -1 -1 -1 3 4 9 0 5 6 13 8 </values> </instantiation>