| Name | AllInterval/AllInterval-m1-s1/ AllInterval-007.xml |
| MD5SUM | a884c61e46efb30737f5a293b2c9f9b8 |
| 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.013697 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 13 |
| Number of constraints | 8 |
| Number of domains | 2 |
| Minimum domain size | 6 |
| Maximum domain size | 7 |
| Distribution of domain sizes | [{"size":6,"count":6},{"size":7,"count":7}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":8},{"degree":3,"count":5}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":3,"count":6},{"arity":6,"count":1},{"arity":7,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6 |
| Distribution of constraint types | [{"type":"intension","count":6},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264793 | SAT | 0.0064300001 | 0.0071519902 |
| miniBTD 2017-06-30 (complete) | 4252116 | SAT | 0.006841 | 0.00770209 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252117 | SAT | 0.011886 | 0.012348 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260032 | SAT | 0.012177 | 0.062031899 |
| cosoco-mini 1.12 (complete) | 4267213 | SAT | 0.01242 | 0.0995811 |
| Naxos 1.1.0 (complete) | 4252118 | SAT | 0.013697 | 0.0143461 |
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] y[0] y[1] y[2] y[3] y[4] y[5] </list> <values> 6 0 5 1 4 2 3 6 5 4 3 2 1 </values> </instantiation>