| Name | Subisomorphism/ Subisomorphism-g10-g27_c18.xml |
| MD5SUM | 92ed35416817fd3e3d52723751690df9 |
| 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 | 95.8001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 41 |
| Number of constraints | 121 |
| Number of domains | 1 |
| Minimum domain size | 86 |
| Maximum domain size | 86 |
| Distribution of domain sizes | [{"size":86,"count":41}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":6},{"degree":5,"count":10},{"degree":6,"count":14},{"degree":7,"count":4},{"degree":8,"count":4},{"degree":10,"count":1},{"degree":11,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 41 |
| Distribution of constraint arities | [{"arity":1,"count":40},{"arity":2,"count":80},{"arity":41,"count":1}] |
| Number of extensional constraints | 120 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":120},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291358 | SAT | 95.8001 | 14.964 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309127 | SAT | 97.0256 | 15.1226 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297272 | SAT | 422.22 | 61.2708 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297771 | SAT | 1171.09 | 147.63 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307456 | SAT | 4745.4 | 603.921 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307220 | SAT | 19665.4 | 2475.16 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297036 | ? (TO) | 20035.8 | 2520.1 |
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] </list> <values> 41 70 33 74 12 30 21 84 0 77 19 10 27 31 65 64 72 18 2 34 85 53 44 47 66 50 79 56 32 69 67 82 71 17 81 51 48 43 35 49 15 </values> </instantiation>