| Name | Crossword/Crossword-m1c-uk-vg/ Crossword-m1c-uk-vg-4-8.xml |
| MD5SUM | 04dba95a54a8594b13594f30f6e89992 |
| 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 | 2.29568 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 32 |
| Number of constraints | 12 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":32}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":32}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":4,"count":8},{"arity":8,"count":4}] |
| Number of extensional constraints | 12 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":12}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267347 | SAT | 0.33646801 | 0.337661 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260166 | SAT | 0.33685401 | 0.42402899 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252730 | SAT | 0.33707201 | 0.39579201 |
| miniBTD 2017-06-30 (complete) | 4252729 | SAT | 2.27088 | 2.3462501 |
| miniBTD 2017-08-10 (complete) | 4264906 | SAT | 2.29568 | 2.38153 |
| Naxos 1.1.0 (complete) | 4252731 | SAT | 6.2789798 | 6.3785701 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type='solution'> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] </list> <values>2 0 17 0 2 0 17 0 0 17 0 12 0 4 0 13 12 0 17 0 3 14 13 0 15 17 4 7 4 13 3 18 </values> </instantiation>