| Name | Subisomorphism/ Subisomorphism-g17-g37_c18.xml |
| MD5SUM | 15f6930ab26cfa444fe93224da66a51d |
| 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 | 1087.96 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 113 |
| Number of domains | 1 |
| Minimum domain size | 120 |
| Maximum domain size | 120 |
| Distribution of domain sizes | [{"size":120,"count":64}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":24},{"degree":5,"count":36}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":2,"count":112},{"arity":64,"count":1}] |
| Number of extensional constraints | 112 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":112},{"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) | 4297774 | SAT | 1087.96 | 137.226 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307459 | SAT | 8917 | 1139.08 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297275 | SAT | 19705 | 2491.01 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307223 | ? (TO) | 19934 | 2520.09 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297039 | ? (TO) | 19937.2 | 2520.12 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309130 | ? (TO) | 19967.1 | 2520.23 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291361 | ? (TO) | 20015.2 | 2520.42 |
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] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] </list> <values>0 112 26 46 61 79 18 113 93 15 64 19 88 34 116 101 50 25 33 55 87 11 22 42 37 4 75 108 71 96 43 104 3 84 78 27 67 110 90 89 48 60 77 31 68 114 2 102 62 49 98 100 8 57 30 16 92 95 106 109 69 115 105 41 </values> </instantiation>