| Name | Dubois/ Dubois-022_c18.xml |
| MD5SUM | 6cb564a1b449df83d852ba5f609dcac6 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.006395 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 66 |
| Number of constraints | 44 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":66}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":66}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":44}] |
| Number of extensional constraints | 44 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":44}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301058 | UNSAT | 0.006395 | 0.00703106 |
| miniBTD_12 2018.07.27_12 (complete) | 4300882 | UNSAT | 0.006798 | 0.00722692 |
| NACRE 1.0.4 (complete) | 4299496 | UNSAT | 0.006944 | 0.00775901 |
| GG's minicp 2018-04-29 (complete) | 4299494 | UNSAT | 69.5433 | 67.7693 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299498 | UNSAT | 88.0148 | 86.1973 |
| MiniCPFever 2018-04-29 (complete) | 4299495 | UNSAT | 88.836 | 86.6996 |
| The dodo solver 2018-04-29 (complete) | 4299500 | UNSAT | 92.2192 | 89.8512 |
| minimacht 2018.07.27 (complete) | 4300706 | UNSAT | 140.016 | 140.022 |
| cosoco 1.12 (complete) | 4299493 | UNSAT | 385.845 | 385.816 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299499 | ? | 377.445 | 373.015 |
| slowpoke 2018-04-29 (incomplete) | 4299497 | ? (TO) | 2520.02 | 2501.61 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: