| Name | Fapp/Fapp-ext/ Fapp-ext-ex1_c18.xml |
| MD5SUM | d2c9b3725c99b98fa2cea517d31ec9e5 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 523 |
| Best CPU time to get the best result obtained on this benchmark | 0.399798 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 21 |
| Number of constraints | 8 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":2,"count":8},{"size":11,"count":4},{"size":12,"count":1},{"size":100,"count":8}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":16},{"degree":3,"count":2},{"degree":5,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":6,"count":4}] |
| Number of extensional constraints | 8 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":8}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4298983 | OPT | 523 | 0.399798 | 0.402146 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298988 | SAT | 523 | 303.657 | 300.608 |
| The dodo solver 2018-04-29 (complete) | 4298989 | SAT (TO) | 523 | 2520.04 | 2511.62 |
| slowpoke 2018-04-29 (incomplete) | 4298986 | SAT (TO) | 523 | 2520.09 | 2515.92 |
| GG's minicp 2018-04-29 (complete) | 4298984 | SAT (TO) | 523 | 2520.09 | 2503.62 |
| MiniCPFever 2018-04-29 (complete) | 4298985 | SAT (TO) | 523 | 2520.12 | 2450.62 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298987 | SAT (TO) | 1291 | 2520.1 | 2480.23 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 523<instantiation type='solution' cost='523'> <list>d[0] d[1] d[2] d[3] f[0] f[1] f[2] f[3] k p[0] p[1] p[2] p[3] v1[0] v1[1] v1[2] v1[3] v2[0] v2[1] v2[2] v2[3] </list> <values>53 46 99 99 47 100 1 1 3 0 1 1 0 0 1 0 0 1 2 0 0 </values> </instantiation>