| Name | AllInterval/AllInterval-m1-s1/ AllInterval-012.xml |
| MD5SUM | fe577b710e96b69a06cd84ef61ac8806 |
| 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.022547999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 23 |
| Number of constraints | 13 |
| Number of domains | 2 |
| Minimum domain size | 11 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":11,"count":11},{"size":12,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":13},{"degree":3,"count":10}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":3,"count":11},{"arity":11,"count":1},{"arity":12,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11 |
| Distribution of constraint types | [{"type":"intension","count":11},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264794 | SAT | 0.011031 | 0.0116359 |
| miniBTD 2017-06-30 (complete) | 4252113 | SAT | 0.011184 | 0.0119959 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252114 | SAT | 0.022532 | 0.023071 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260033 | SAT | 0.022547999 | 0.141285 |
| cosoco-mini 1.12 (complete) | 4267214 | SAT | 0.022553001 | 0.11722 |
| Naxos 1.1.0 (complete) | 4252115 | SAT | 0.024242 | 0.0252179 |
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] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] </list> <values> 11 0 10 1 9 2 8 3 7 4 6 5 11 10 9 8 7 6 5 4 3 2 1 </values> </instantiation>