| Name | Dubois/ Dubois-075_c18.xml |
| MD5SUM | 8909e39e4e2640ab20c6938b58673ed4 |
| 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.018123 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 225 |
| Number of constraints | 150 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":225}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":225}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":150}] |
| Number of extensional constraints | 150 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":150}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301065 | UNSAT | 0.018123 | 0.0187721 |
| miniBTD_12 2018.07.27_12 (complete) | 4300889 | UNSAT | 0.018862 | 0.0196609 |
| NACRE 1.0.4 (complete) | 4299448 | UNSAT | 0.034358 | 0.0346169 |
| minimacht 2018.07.27 (complete) | 4300713 | ? (TO) | 2519.93 | 2520.01 |
| The dodo solver 2018-04-29 (complete) | 4299452 | ? (TO) | 2520.04 | 2487.31 |
| MiniCPFever 2018-04-29 (complete) | 4299447 | ? (TO) | 2520.04 | 2477.31 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299450 | ? (TO) | 2520.05 | 2480.41 |
| cosoco 1.12 (complete) | 4299445 | ? (TO) | 2520.07 | 2519.9 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299451 | ? (TO) | 2520.09 | 2494.12 |
| GG's minicp 2018-04-29 (complete) | 4299446 | ? (TO) | 2520.09 | 2492.82 |
| slowpoke 2018-04-29 (incomplete) | 4299449 | ? (TO) | 2520.1 | 2502.51 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: