| Name | AllInterval/AllInterval-m1-s1/ AllInterval-016.xml |
| MD5SUM | dac573268cbee9df0798b3d421ad7cf6 |
| 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 | 0.043993 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 31 |
| Number of constraints | 17 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":16,"count":16}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":17},{"degree":3,"count":14}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":15},{"arity":15,"count":1},{"arity":16,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 15 |
| Distribution of constraint types | [{"type":"intension","count":15},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264795 | SAT | 0.018676 | 0.019261001 |
| miniBTD 2017-06-30 (complete) | 4252125 | SAT | 0.018951 | 0.0195719 |
| Naxos 1.1.0 (complete) | 4252127 | SAT | 0.037161 | 0.0371811 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260034 | SAT | 0.043993 | 0.10574 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252126 | SAT | 0.04482 | 0.0456141 |
| cosoco-mini 1.12 (complete) | 4267215 | SAT | 0.045324001 | 0.097695902 |
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] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] </list> <values> 15 0 14 1 13 2 12 3 11 4 10 5 9 6 8 7 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 </values> </instantiation>