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