| 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.004242 |
| 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 |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4301446 | OPT | 54 | 0.004242 | 0.00484805 |
| Mistral-2.0 2018-08-01 (complete) | 4312516 | OPT | 54 | 0.00436 | 0.00508108 |
| Sat4j-CSP 2018-07-11 (complete) | 4301445 | OPT | 54 | 0.57811 | 0.555005 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301444 | OPT | 54 | 0.815633 | 0.463172 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310550 | OPT | 54 | 1.47316 | 1.01263 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312408 | OPT | 54 | 1.48941 | 1.51158 |
| Concrete 3.9.2 (complete) | 4302574 | OPT | 54 | 5.95499 | 3.2387 |
| Concrete 3.9.2-SuperNG (complete) | 4302924 | OPT | 54 | 6.08432 | 3.24433 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310200 | SAT | 54 | 251.246 | 247.366 |
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>