| Name | Dubois/ Dubois-020_c18.xml |
| MD5SUM | 456a853e8f92228a7cc5dd61b0b89dd6 |
| 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.006227 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 40 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":60}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":60}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":40}] |
| Number of extensional constraints | 40 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":40}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301056 | UNSAT | 0.006227 | 0.00694391 |
| NACRE 1.0.4 (complete) | 4299472 | UNSAT | 0.006265 | 0.00713789 |
| miniBTD_12 2018.07.27_12 (complete) | 4300880 | UNSAT | 0.006307 | 0.00704302 |
| GG's minicp 2018-04-29 (complete) | 4299470 | UNSAT | 18.3594 | 17.1341 |
| MiniCPFever 2018-04-29 (complete) | 4299471 | UNSAT | 23.577 | 22.0746 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299474 | UNSAT | 23.8159 | 22.5977 |
| The dodo solver 2018-04-29 (complete) | 4299476 | UNSAT | 23.8824 | 21.948 |
| minimacht 2018.07.27 (complete) | 4300704 | UNSAT | 53.5344 | 53.5359 |
| cosoco 1.12 (complete) | 4299469 | UNSAT | 82.7414 | 82.7458 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299475 | ? | 315.995 | 312.243 |
| slowpoke 2018-04-29 (incomplete) | 4299473 | ? (TO) | 2520.02 | 2503.02 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: