| Name | Auction/Auction-sum/ Auction-sum-example_c18.xml |
| MD5SUM | ef5ffd6d9cd3ce1d40ba669a8320885c |
| 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.004577 |
| 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":"sum","count":4}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4298497 | OPT | 54 | 0.004577 | 0.00600411 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298501 | OPT | 54 | 0.483386 | 0.302837 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298502 | SAT | 54 | 302.458 | 300.31 |
| slowpoke 2018-04-29 (incomplete) | 4298500 | SAT (TO) | 54 | 2520.04 | 2509.81 |
| GG's minicp 2018-04-29 (complete) | 4298498 | SAT (TO) | 54 | 2520.05 | 2508.31 |
| The dodo solver 2018-04-29 (complete) | 4298503 | SAT (TO) | 54 | 2520.1 | 2512.91 |
| MiniCPFever 2018-04-29 (complete) | 4298499 | SAT (TO) | 54 | 2522.31 | 2264.81 |
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='solution' cost='54'> <list>b[0] b[1] b[2] b[3] b[4] </list> <values>0 0 0 1 1 </values> </instantiation>