| 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 | 1784.38 |
| 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 |
|---|---|---|---|---|
| MiniCPFever 2018-04-29 (complete) | 4299897 | SAT | 1784.38 | 1750.01 |
| miniBTD 2018.07.27_3 (complete) | 4301125 | SAT | 2422.5 | 2422.44 |
| minimacht 2018.07.27 (complete) | 4300773 | ? | 2520.04 | 2519.88 |
| NACRE 1.0.4 (complete) | 4299898 | ? (TO) | 2519.56 | 2520.02 |
| miniBTD_12 2018.07.27_12 (complete) | 4300949 | ? (TO) | 2519.72 | 2520.01 |
| cosoco 1.12 (complete) | 4299895 | ? (TO) | 2519.86 | 2520.01 |
| The dodo solver 2018-04-29 (complete) | 4299902 | ? (TO) | 2520.03 | 2512.71 |
| GG's minicp 2018-04-29 (complete) | 4299896 | ? (TO) | 2520.05 | 2506.32 |
| slowpoke 2018-04-29 (incomplete) | 4299899 | ? (TO) | 2520.06 | 2515.71 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299900 | ? (TO) | 2520.08 | 2479.82 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299901 | ? (TO) | 2520.11 | 2516.31 |
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 93 50 37 3 48 62 92 112 15 25 4 84 60 49 95 26 64 33 75 78 77 98 106 46 19 55 108 27 31 100 109 61 88 87 71 67 68 8 32 79 34 11 96 110 114 57 115 18 116 22 43 90 2 30 105 113 101 42 104 21 102 16 41 </values> </instantiation>