Name | Langford/ LangfordBin-09_c18.xml |
MD5SUM | af6539439e5a66b9d4cb5cb754e7ed18 |
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.557709 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 36 |
Number of constraints | 27 |
Number of domains | 2 |
Minimum domain size | 9 |
Maximum domain size | 18 |
Distribution of domain sizes | [{"size":9,"count":18},{"size":18,"count":18}] |
Minimum variable degree | 2 |
Maximum variable degree | 18 |
Distribution of variable degrees | [{"degree":2,"count":18},{"degree":18,"count":18}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 19 |
Distribution of constraint arities | [{"arity":2,"count":9},{"arity":19,"count":18}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 9 |
Distribution of constraint types | [{"type":"intension","count":9},{"type":"element","count":18}] |
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) | 4299343 | UNSAT | 0.557709 | 0.32734 |
The dodo solver 2018-04-29 (complete) | 4299345 | UNSAT | 2.88119 | 1.403 |
MiniCPFever 2018-04-29 (complete) | 4299340 | UNSAT | 6.08991 | 3.52143 |
GG's minicp 2018-04-29 (complete) | 4299339 | UNSAT | 42.0914 | 39.3357 |
miniBTD_12 2018.07.27_12 (complete) | 4300871 | ? | 2520 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300695 | ? | 2520.01 | 2519.71 |
NACRE 1.0.4 (complete) | 4299341 | ? (TO) | 2519.8 | 2520.01 |
miniBTD 2018.07.27_3 (complete) | 4301047 | ? (TO) | 2519.96 | 2520.01 |
slowpoke 2018-04-29 (incomplete) | 4299342 | ? (TO) | 2520.07 | 2461.14 |
cosoco 1.12 (complete) | 4299338 | ? (TO) | 2520.07 | 2519.9 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299344 | Wrong Cert. | 1.54989 | 0.659991 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: