2017 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Subisomorphism/Subisomorphism-m1-SF/
Subisomorphism-A-15.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-SF/
Subisomorphism-A-15.xml
MD5SUM31fe6553e55375ea7453a010bd43cd35
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark1.49737
Satisfiable
(Un)Satisfiability was proved
Number of variables180
Number of constraints549
Number of domains1
Minimum domain size200
Maximum domain size200
Distribution of domain sizes[{"size":200,"count":180}]
Minimum variable degree3
Maximum variable degree10
Distribution of variable degrees[{"degree":3,"count":1},{"degree":4,"count":7},{"degree":5,"count":33},{"degree":6,"count":70},{"degree":8,"count":38},{"degree":9,"count":23},{"degree":10,"count":8}]
Minimum constraint arity1
Maximum constraint arity180
Distribution of constraint arities[{"arity":1,"count":69},{"arity":2,"count":479},{"arity":180,"count":1}]
Number of extensional constraints548
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":548},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.12 (complete)4267477SAT 0.062098 0.063157
cosoco-mini 1.1 (2017-07-29) (complete)4260296SAT 0.062185001 0.124848
cosoco-mini 1.1 (2017-06-27) (complete)4252925SAT 0.062647 0.062698
Naxos 1.1.0 (complete)4252926SAT 1.49737 1.49727
miniBTD 2017-08-10 (complete)4265036SAT 16.069201 16.0709
miniBTD 2017-06-30 (complete)4252924SAT 17.1626 17.1644

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:
Solution found:
<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] 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]
x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86]
x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108]
x[109] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128]
x[129] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148]
x[149] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168]
x[169] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] </list> <values>140 32 92 68 172 44 185 88 55 26 76 84 117 195
4 78 107 95 121 174 173 17 159 134 197 133 48 136 171 77 33 168 187 9 85 193 192 59 15 167 115 7 40 0 54 186 73 12 137 146 177 36 148 99 111
152 18 45 62 75 13 147 89 198 82 170 109 189 52 184 176 132 64 125 175 14 138 105 153 199 86 196 155 28 165 90 178 100 94 57 19 87 25 42 39
56 16 3 181 37 158 6 116 50 21 46 180 103 124 112 160 114 27 108 154 139 142 101 29 135 71 31 8 102 98 43 58 74 144 150 20 93 38 61 156 183
161 91 22 83 123 70 79 63 188 23 157 169 97 120 41 47 66 30 11 166 65 151 60 130 131 128 53 34 72 122 69 179 10 164 35 51 127 191 5 2 119
110 143 145 </values> </instantiation>