| Name | Subisomorphism/ Subisomorphism-g08-g43_c18.xml |
| MD5SUM | 7cef523f02717582c22db5e2b6d8dc99 |
| 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 | 3.59401 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 93 |
| Number of domains | 1 |
| Minimum domain size | 128 |
| Maximum domain size | 128 |
| Distribution of domain sizes | [{"size":128,"count":30}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":3},{"degree":5,"count":10},{"degree":6,"count":3},{"degree":7,"count":6},{"degree":8,"count":4},{"degree":9,"count":3}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":1,"count":30},{"arity":2,"count":62},{"arity":30,"count":1}] |
| Number of extensional constraints | 92 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":92},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297769 | SAT | 3.59401 | 0.982034 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291356 | SAT | 10.5672 | 5.31202 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309125 | SAT | 10.869 | 5.53253 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297034 | SAT | 54.7941 | 37.8512 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307454 | SAT | 55.883 | 38.5561 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297270 | SAT | 55.9602 | 38.0105 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307218 | SAT | 56.1185 | 38.7843 |
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>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] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] </list> <values>1 27 115 92 65 114 74 44 67 37 52 83 9 60 126 57 23 122 95 81 125 19 106 110 112 68 35 29 5 93 </values> </instantiation>