2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-SF/
Subisomorphism-A-20.xml
MD5SUMc3d3968bb4d1a566be21f2b70665db2a
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 benchmark0.041556
Satisfiable
(Un)Satisfiability was proved
Number of variables180
Number of constraints563
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":11},{"degree":5,"count":27},{"degree":6,"count":64},{"degree":8,"count":42},{"degree":9,"count":25},{"degree":10,"count":10}]
Minimum constraint arity1
Maximum constraint arity180
Distribution of constraint arities[{"arity":1,"count":77},{"arity":2,"count":485},{"arity":180,"count":1}]
Number of extensional constraints562
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":562},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2.0 (complete)4407912SAT 0.041556 0.0413169
cosoco 2.0 (complete)4396652SAT 0.041746 0.041481
cosoco 2 (complete)4389372SAT 0.042456 0.0422709
cosoco 2.0 parallel (complete)4409192SAT 0.306635 0.0736189
cosoco 2.O parallel (complete)4397932SAT 0.329277 0.098664
BTD 19.07.01 (complete)4386804SAT 0.419156 0.419783
choco-solver 2019-09-24 (complete)4405732SAT 2.6363 1.17723
PicatSAT 2019-09-12 (complete)4394852SAT 3.22553 3.23052
AbsCon 2019-07-23 (complete)4390472SAT 4.52028 2.5644
choco-solver 2019-09-16 (complete)4398832SAT 4.92978 1.95088
choco-solver 2019-06-14 (complete)4392872SAT 5.02594 1.66694
choco-solver 2019-09-20 (complete)4403332SAT 5.11146 1.69526
choco-solver 2019-09-20 parallel (complete)4404232SAT 9.01635 1.97028
choco-solver 2019-09-16 parallel (complete)4399432SAT 9.36175 2.00537
choco-solver 2019-09-24 parallel (complete)4406632SAT 9.83618 2.05751
choco-solver 2019-06-14 parallel (complete)4393472SAT 11.2357 2.26915
Concrete 3.10 (complete)4387263SAT 12.7818 5.94631
Concrete 3.12.2 (complete)4400632SAT 13.8195 6.09532
Concrete 3.12.2 (complete)4395752SAT 14.2786 6.22666
Concrete 3.12.3 (complete)4402432SAT 14.3318 6.34034
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387990SAT 178.047 142.108
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387989SAT 189.745 154.238
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392272SAT 210.41 151.875
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392572SAT 215.379 156.789
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405432SAT 216.322 158.033
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405132SAT 222.233 159.289

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