| Name | PrizeCollecting/PrizeCollecting-jok-s1/ PrizeCollecting-24-4-6-4.xml |
| MD5SUM | e870fb3a9053f33a7d0d8e73b49cdad7 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 35 |
| Best CPU time to get the best result obtained on this benchmark | 37.85 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 72 |
| Number of constraints | 97 |
| Number of domains | 24 |
| Minimum domain size | 4 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":4,"count":12},{"size":5,"count":12},{"size":25,"count":48}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":2,"count":24},{"degree":25,"count":23},{"degree":26,"count":1},{"degree":27,"count":24}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":48},{"arity":24,"count":24},{"arity":25,"count":24}] |
| Number of extensional constraints | 48 |
| Number of intensional constraints | 25 |
| Distribution of constraint types | [{"type":"extension","count":48},{"type":"intension","count":25},{"type":"count","count":24}] |
| 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: 35<instantiation> <list>s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[20] s[21] s[22] s[23] p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] p[15] p[16] p[17] p[18] p[19] p[20] p[21] p[22] p[23] g[0] g[1] g[2] g[3] g[4] g[5] g[6] g[7] g[8] g[9] g[10] g[11] g[12] g[13] g[14] g[15] g[16] g[17] g[18] g[19] g[20] g[21] g[22] g[23] </list> <values>6 0 1 9 3 4 7 13 2 8 -1 5 18 12 -1 -1 -1 11 19 20 21 22 23 17 0 19 18 15 14 13 1 2 17 16 -1 12 4 3 -1 -1 -1 11 5 6 7 8 9 10 3 -5 7 -3 2 -1 -3 2 6 8 0 3 4 2 0 0 0 0 -3 9 -3 0 5 2 </values> </instantiation>