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

Result page for benchmark
Subisomorphism/Subisomorphism-m1-si2-bvg/
Subisomorphism-si2-b09-m200-02.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-si2-bvg/
Subisomorphism-si2-b09-m200-02.xml
MD5SUM58809a6bda86b5c8d29edf225741fab0
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.014066
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints155
Number of domains1
Minimum domain size200
Maximum domain size200
Distribution of domain sizes[{"size":200,"count":40}]
Minimum variable degree4
Maximum variable degree10
Distribution of variable degrees[{"degree":4,"count":1},{"degree":5,"count":2},{"degree":6,"count":3},{"degree":7,"count":4},{"degree":8,"count":4},{"degree":9,"count":4},{"degree":10,"count":22}]
Minimum constraint arity2
Maximum constraint arity40
Distribution of constraint arities[{"arity":2,"count":154},{"arity":40,"count":1}]
Number of extensional constraints154
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":154},{"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.1 (2017-06-27) (complete)4252940SAT 0.013853 0.0168859
cosoco-mini 1.12 (complete)4267478SAT 0.014066 0.0147069
cosoco-mini 1.1 (2017-07-29) (complete)4260297SAT 0.014221 0.103669
Naxos 1.1.0 (complete)4252941SAT 0.098801 0.099664
miniBTD 2017-06-30 (complete)4252939SAT 0.12367 0.124602
miniBTD 2017-08-10 (complete)4265037SAT 0.124195 0.23004299

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] </list>
<values>0 1 43 58 59 73 76 120 144 197 77 89 150 163 72 151 28 128 31 41 92 167 70 137 153 170 9 29 38 71 78 169 141 149 67 183 65 174 85
130 </values> </instantiation>