| Name | Auction/Auction-cnt/ Auction-cnt-example_c18.xml |
| MD5SUM | b170f5ced0cb389de51404fef1a5e95b |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 54 |
| Best CPU time to get the best result obtained on this benchmark | 0.004732 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 5 |
| Number of constraints | 4 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":5}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":3},{"degree":4,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":2,"count":2},{"arity":3,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"count","count":4}] |
| 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: 54<instantiation type="optimum" cost="54"> <list> b[0] b[1] b[2] b[3] b[4] </list> <values> 0 0 0 1 1 </values> </instantiation>