Name | Langford/ LangfordBin-14_c18.xml |
MD5SUM | 907d87f313d4aa93f4a53d5ea17b135a |
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.623677 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 56 |
Number of constraints | 42 |
Number of domains | 2 |
Minimum domain size | 14 |
Maximum domain size | 28 |
Distribution of domain sizes | [{"size":14,"count":28},{"size":28,"count":28}] |
Minimum variable degree | 2 |
Maximum variable degree | 28 |
Distribution of variable degrees | [{"degree":2,"count":28},{"degree":28,"count":28}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 29 |
Distribution of constraint arities | [{"arity":2,"count":14},{"arity":29,"count":28}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 14 |
Distribution of constraint types | [{"type":"intension","count":14},{"type":"element","count":28}] |
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) | 4299279 | UNSAT | 0.623677 | 0.343109 |
NACRE 1.0.4 (complete) | 4299277 | ? (TO) | 2519.8 | 2520.01 |
miniBTD 2018.07.27_3 (complete) | 4301052 | ? (TO) | 2519.92 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300700 | ? (TO) | 2519.98 | 2520.01 |
miniBTD_12 2018.07.27_12 (complete) | 4300876 | ? (TO) | 2520.01 | 2520.01 |
MiniCPFever 2018-04-29 (complete) | 4299276 | ? (TO) | 2520.03 | 2476.61 |
The dodo solver 2018-04-29 (complete) | 4299281 | ? (TO) | 2520.07 | 2515.71 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299280 | ? (TO) | 2520.07 | 2510.41 |
cosoco 1.12 (complete) | 4299274 | ? (TO) | 2520.08 | 2519.9 |
slowpoke 2018-04-29 (incomplete) | 4299278 | ? (TO) | 2520.11 | 2435.73 |
GG's minicp 2018-04-29 (complete) | 4299275 | ? (TO) | 2520.11 | 2493.03 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: