| Name | MisteryShopper/ MisteryShopper-04_c18.xml |
| MD5SUM | 0b82fb3eeae4b26efaa96bf656c68c27 |
| 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.49755 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 144 |
| Number of constraints | 109 |
| Number of domains | 3 |
| Minimum domain size | 3 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":3,"count":36},{"size":4,"count":36},{"size":12,"count":72}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":72},{"degree":3,"count":36},{"degree":4,"count":27},{"degree":5,"count":9}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":2,"count":72},{"arity":3,"count":27},{"arity":12,"count":6},{"arity":24,"count":3},{"arity":36,"count":1}] |
| Number of extensional constraints | 72 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":72},{"type":"allDifferent","count":30},{"type":"ordered","count":3},{"type":"lex","count":1},{"type":"channel","count":3}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297832 | SAT | 2.49755 | 0.82483 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297333 | SAT | 7.59654 | 2.64688 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297097 | SAT | 7.81566 | 2.80584 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307517 | SAT | 8.6365 | 3.44541 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307281 | SAT | 8.95431 | 3.76578 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309188 | SAT | 13.0367 | 5.64156 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291419 | SAT | 13.3246 | 5.61067 |
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>vr[0][0] vr[0][1] vr[0][2] vr[1][0] vr[1][1] vr[1][2] vr[2][0] vr[2][1] vr[2][2] vr[3][0] vr[3][1] vr[3][2] vr[4][0] vr[4][1] vr[4][2] vr[5][0] vr[5][1] vr[5][2] vr[6][0] vr[6][1] vr[6][2] vr[7][0] vr[7][1] vr[7][2] vr[8][0] vr[8][1] vr[8][2] vr[9][0] vr[9][1] vr[9][2] vr[10][0] vr[10][1] vr[10][2] vr[11][0] vr[11][1] vr[11][2] ve[0][0] ve[0][1] ve[0][2] ve[1][0] ve[1][1] ve[1][2] ve[2][0] ve[2][1] ve[2][2] ve[3][0] ve[3][1] ve[3][2] ve[4][0] ve[4][1] ve[4][2] ve[5][0] ve[5][1] ve[5][2] ve[6][0] ve[6][1] ve[6][2] ve[7][0] ve[7][1] ve[7][2] ve[8][0] ve[8][1] ve[8][2] ve[9][0] ve[9][1] ve[9][2] ve[10][0] ve[10][1] ve[10][2] ve[11][0] ve[11][1] ve[11][2] gvr[0][0] gvr[0][1] gvr[0][2] gvr[1][0] gvr[1][1] gvr[1][2] gvr[2][0] gvr[2][1] gvr[2][2] gvr[3][0] gvr[3][1] gvr[3][2] gvr[4][0] gvr[4][1] gvr[4][2] gvr[5][0] gvr[5][1] gvr[5][2] gvr[6][0] gvr[6][1] gvr[6][2] gvr[7][0] gvr[7][1] gvr[7][2] gvr[8][0] gvr[8][1] gvr[8][2] gvr[9][0] gvr[9][1] gvr[9][2] gvr[10][0] gvr[10][1] gvr[10][2] gvr[11][0] gvr[11][1] gvr[11][2] gve[0][0] gve[0][1] gve[0][2] gve[1][0] gve[1][1] gve[1][2] gve[2][0] gve[2][1] gve[2][2] gve[3][0] gve[3][1] gve[3][2] gve[4][0] gve[4][1] gve[4][2] gve[5][0] gve[5][1] gve[5][2] gve[6][0] gve[6][1] gve[6][2] gve[7][0] gve[7][1] gve[7][2] gve[8][0] gve[8][1] gve[8][2] gve[9][0] gve[9][1] gve[9][2] gve[10][0] gve[10][1] gve[10][2] gve[11][0] gve[11][1] gve[11][2] </list> <values>0 7 8 1 5 10 2 11 6 3 6 9 4 8 0 5 10 1 6 0 11 7 9 3 8 4 2 9 1 4 10 2 5 11 3 7 0 6 4 1 9 5 2 10 8 3 11 7 4 8 9 5 1 10 6 3 2 7 0 11 8 4 0 9 7 3 10 5 1 11 2 6 0 1 2 0 1 2 0 2 1 0 1 2 1 2 0 1 2 0 1 0 2 1 2 0 2 1 0 2 0 1 2 0 1 2 0 1 0 2 1 0 3 2 0 3 2 1 3 2 1 2 3 2 0 3 2 1 0 2 0 3 2 1 0 3 2 1 3 2 0 3 0 2 </values> </instantiation>