Name | Langford/ LangfordBin-13_c18.xml |
MD5SUM | af26c9d63c7c51246c3bfb55117cf2b4 |
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.615449 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 52 |
Number of constraints | 39 |
Number of domains | 2 |
Minimum domain size | 13 |
Maximum domain size | 26 |
Distribution of domain sizes | [{"size":13,"count":26},{"size":26,"count":26}] |
Minimum variable degree | 2 |
Maximum variable degree | 26 |
Distribution of variable degrees | [{"degree":2,"count":26},{"degree":26,"count":26}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 27 |
Distribution of constraint arities | [{"arity":2,"count":13},{"arity":27,"count":26}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 13 |
Distribution of constraint types | [{"type":"intension","count":13},{"type":"element","count":26}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299335 | UNSAT | 0.615449 | 0.330138 |
NACRE 1.0.4 (complete) | 4299333 | ? (TO) | 2519.73 | 2520.01 |
miniBTD_12 2018.07.27_12 (complete) | 4300875 | ? (TO) | 2519.83 | 2520.01 |
miniBTD 2018.07.27_3 (complete) | 4301051 | ? (TO) | 2519.94 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300699 | ? (TO) | 2519.94 | 2520.01 |
slowpoke 2018-04-29 (incomplete) | 4299334 | ? (TO) | 2520.05 | 2429.23 |
GG's minicp 2018-04-29 (complete) | 4299331 | ? (TO) | 2520.05 | 2497.13 |
MiniCPFever 2018-04-29 (complete) | 4299332 | ? (TO) | 2520.07 | 2478.51 |
The dodo solver 2018-04-29 (complete) | 4299337 | ? (TO) | 2520.1 | 2515.31 |
cosoco 1.12 (complete) | 4299330 | ? (TO) | 2520.1 | 2519.9 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299336 | Wrong Cert. | 268.549 | 266.324 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: