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 | 1.21334 |
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 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <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> 35 85 1 37 60 29 93 68 115 57 23 51 65 122 114 52 9 45 44 106 117 24 21 27 112 81 40 74 67 19 </values> </instantiation>