| Name | Dubois/ Dubois-024_c18.xml |
| MD5SUM | 4f48250d2147fae0e085f28a4cc8c702 |
| 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.006869 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 72 |
| Number of constraints | 48 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":72}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":72}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":48}] |
| Number of extensional constraints | 48 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":48}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301060 | UNSAT | 0.006869 | 0.00748204 |
| NACRE 1.0.4 (complete) | 4299512 | UNSAT | 0.007439 | 0.00842707 |
| miniBTD_12 2018.07.27_12 (complete) | 4300884 | UNSAT | 0.007728 | 0.00829505 |
| GG's minicp 2018-04-29 (complete) | 4299510 | UNSAT | 277.05 | 273.34 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299514 | UNSAT | 365.755 | 360.293 |
| MiniCPFever 2018-04-29 (complete) | 4299511 | UNSAT | 367.049 | 361.354 |
| The dodo solver 2018-04-29 (complete) | 4299516 | UNSAT | 384.317 | 379.656 |
| minimacht 2018.07.27 (complete) | 4300708 | UNSAT | 812.513 | 812.551 |
| cosoco 1.12 (complete) | 4299509 | UNSAT | 1137.12 | 1137.04 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299515 | ? | 393.152 | 388.822 |
| slowpoke 2018-04-29 (incomplete) | 4299513 | ? (TO) | 2520.05 | 2501.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: