Name | Crossword/ Crossword-m18-ogd2008-vg-05-06_c18.xml |
MD5SUM | 81d4059c2b76389bba6ef17dee6cb29a |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 6.39052 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 30 |
Number of constraints | 11 |
Number of domains | 1 |
Minimum domain size | 26 |
Maximum domain size | 26 |
Distribution of domain sizes | [{"size":26,"count":30}] |
Minimum variable degree | 2 |
Maximum variable degree | 2 |
Distribution of variable degrees | [{"degree":2,"count":30}] |
Minimum constraint arity | 5 |
Maximum constraint arity | 6 |
Distribution of constraint arities | [{"arity":5,"count":6},{"arity":6,"count":5}] |
Number of extensional constraints | 11 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":11}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297797 | SAT | 6.39052 | 3.28668 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309153 | SAT | 12.4489 | 4.00526 |
scop order+glucose-syrup (2018-07-07) (complete) | 4297062 | SAT | 134.984 | 79.2309 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297298 | SAT | 142.225 | 82.58 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307482 | SAT | 144.498 | 83.8061 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307246 | SAT | 147.79 | 84.9365 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291384 | SAT | 786.066 | 775.299 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] </list> <values>0 20 2 20 1 0 20 18 4 17 0 18 9 0 17 0 6 0 0 9 0 17 0 13 2 0 13 0 3 0 </values> </instantiation>