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

Result page for benchmark
Subisomorphism/Subisomorphism-m1-si2-m4D/
Subisomorphism-si2-m4Dr6-m256-00.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-si2-m4D/
Subisomorphism-si2-m4Dr6-m256-00.xml
MD5SUM73ef0e8387fdebf21bbae2b4acf5d521
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.036418
Satisfiable
(Un)Satisfiability was proved
Number of variables51
Number of constraints105
Number of domains1
Minimum domain size256
Maximum domain size256
Distribution of domain sizes[{"size":256,"count":51}]
Minimum variable degree2
Maximum variable degree11
Distribution of variable degrees[{"degree":2,"count":11},{"degree":3,"count":12},{"degree":4,"count":11},{"degree":6,"count":3},{"degree":7,"count":3},{"degree":8,"count":3},{"degree":9,"count":5},{"degree":10,"count":1},{"degree":11,"count":2}]
Minimum constraint arity1
Maximum constraint arity51
Distribution of constraint arities[{"arity":1,"count":17},{"arity":2,"count":87},{"arity":51,"count":1}]
Number of extensional constraints104
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":104},{"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)4396649SAT 0.036418 0.0368781
cosoco 2 (complete)4389369SAT 0.036536 0.0367949
cosoco 2.0 (complete)4407909SAT 0.036764 0.037195
BTD 19.07.01 (complete)4386805SAT 0.073426 0.0739439
cosoco 2.0 parallel (complete)4409189SAT 0.133814 0.0347091
cosoco 2.O parallel (complete)4397929SAT 0.17181 0.040602
choco-solver 2019-09-24 (complete)4405729SAT 2.10871 0.91379
choco-solver 2019-06-14 (complete)4392869SAT 2.47162 0.931373
choco-solver 2019-09-16 (complete)4398829SAT 2.56869 0.96636
choco-solver 2019-09-20 (complete)4403329SAT 2.64328 0.988292
AbsCon 2019-07-23 (complete)4390469SAT 4.09359 2.65092
choco-solver 2019-09-20 parallel (complete)4404229SAT 4.36291 1.12283
choco-solver 2019-09-16 parallel (complete)4399429SAT 4.66344 1.15574
choco-solver 2019-09-24 parallel (complete)4406629SAT 4.7559 1.16205
choco-solver 2019-06-14 parallel (complete)4393469SAT 4.85132 1.19196
Concrete 3.12.3 (complete)4402429SAT 9.87394 5.10394
Concrete 3.12.2 (complete)4400629SAT 10.2553 4.29963
Concrete 3.12.2 (complete)4395749SAT 11.343 4.64728
Concrete 3.10 (complete)4387264SAT 11.5016 4.7051
PicatSAT 2019-09-12 (complete)4394849SAT 22.247 22.2469
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387993SAT 50.7585 34.8367
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387992SAT 52.9981 36.885
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392569SAT 55.6822 38.3674
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405129SAT 55.8022 37.9856
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392269SAT 55.9097 38.5524
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405429SAT 56.2511 38.1831

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] </list> <values>0 39 93 100 179 214 43 116 154 167 200 213 247 249 59 75 215 228
254 48 125 135 105 124 255 203 223 234 237 88 104 112 118 138 208 239 82 99 172 225 246 227 76 35 6 47 69 77 197 207 27 </values>
</instantiation>