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

Result page for benchmark
Subisomorphism/Subisomorphism-m1-si2-bvg/
Subisomorphism-si2-b06m-m400-03.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-si2-bvg/
Subisomorphism-si2-b06m-m400-03.xml
MD5SUMf1702622d49cf987df96627c7341e578
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.018841
Satisfiable
(Un)Satisfiability was proved
Number of variables80
Number of constraints163
Number of domains1
Minimum domain size400
Maximum domain size400
Distribution of domain sizes[{"size":400,"count":80}]
Minimum variable degree2
Maximum variable degree20
Distribution of variable degrees[{"degree":2,"count":13},{"degree":3,"count":19},{"degree":4,"count":23},{"degree":6,"count":4},{"degree":7,"count":11},{"degree":8,"count":8},{"degree":19,"count":1},{"degree":20,"count":1}]
Minimum constraint arity1
Maximum constraint arity80
Distribution of constraint arities[{"arity":1,"count":25},{"arity":2,"count":137},{"arity":80,"count":1}]
Number of extensional constraints162
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":162},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2 (complete)4389965SAT 0.018841 0.019264
cosoco 2.0 (complete)4397245SAT 0.019166 0.0194641
cosoco 2.0 (complete)4408505SAT 0.020754 0.021273
NACRE 1.0.5 (complete)4391565SAT 0.130739 0.131251
NACRE 1.0.5-Hybrid (complete)4391365SAT 0.131994 0.132322
miniBTD 19.06.16 (complete)4391765SAT 0.297127 0.297708
(reference) PicatSAT 2019-09-12 (complete)4407680SAT 1.95734 1.9631

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] </list> <values>0 4 46 68 71 72 122 156 202
210 218 219 246 254 288 306 345 372 22 31 34 80 239 96 147 161 124 129 102 106 88 386 11 7 15 166 286 215 315 216 108 211 2 360 18 63 208
338 293 13 85 90 252 383 191 351 33 178 301 318 9 325 204 105 10 6 20 261 39 309 336 182 179 59 142 130 165 143 300 354 </values>
</instantiation>