Name | Langford/ LangfordBin-06_c18.xml |
MD5SUM | 067c7c3f6995d0e6d34aa4db2f294f93 |
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.203771 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 24 |
Number of constraints | 18 |
Number of domains | 2 |
Minimum domain size | 6 |
Maximum domain size | 12 |
Distribution of domain sizes | [{"size":6,"count":12},{"size":12,"count":12}] |
Minimum variable degree | 2 |
Maximum variable degree | 12 |
Distribution of variable degrees | [{"degree":2,"count":12},{"degree":12,"count":12}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 13 |
Distribution of constraint arities | [{"arity":2,"count":6},{"arity":13,"count":12}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 6 |
Distribution of constraint types | [{"type":"intension","count":6},{"type":"element","count":12}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
minimacht 2018.07.27 (complete) | 4300692 | UNSAT | 0.203771 | 0.20486 |
miniBTD_12 2018.07.27_12 (complete) | 4300868 | UNSAT | 0.223411 | 0.223931 |
miniBTD 2018.07.27_3 (complete) | 4301044 | UNSAT | 0.236967 | 0.237778 |
NACRE 1.0.4 (complete) | 4299325 | UNSAT | 0.535821 | 0.536408 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299327 | UNSAT | 0.536018 | 0.315475 |
The dodo solver 2018-04-29 (complete) | 4299329 | UNSAT | 0.662644 | 0.357187 |
GG's minicp 2018-04-29 (complete) | 4299323 | UNSAT | 0.66661 | 0.367895 |
MiniCPFever 2018-04-29 (complete) | 4299324 | UNSAT | 0.7759 | 0.40018 |
cosoco 1.12 (complete) | 4299322 | UNSAT | 1.04402 | 1.04613 |
slowpoke 2018-04-29 (incomplete) | 4299326 | ? (TO) | 2520.09 | 2464.42 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299328 | Wrong Cert. | 0.607048 | 0.338734 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: