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

Result page for benchmark
LowAutocorrelation/LowAutocorrelation-m1-s1/
LowAutocorrelation-017.xml

Jump to solvers results

General information on the benchmark

NameLowAutocorrelation/LowAutocorrelation-m1-s1/
LowAutocorrelation-017.xml
MD5SUM0c1c5c68e188d2d47ba67b7c3f6e3a51
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark32
Best CPU time to get the best result obtained on this benchmark26.99
Satisfiable
(Un)Satisfiability was proved
Number of variables305
Number of constraints168
Number of domains33
Minimum domain size2
Maximum domain size33
Distribution of domain sizes[{"size":2,"count":154},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":2},{"size":8,"count":1},{"size":9,"count":2},{"size":10,"count":1},{"size":11,"count":2},{"size":12,"count":1},{"size":13,"count":2},{"size":14,"count":1},{"size":15,"count":2},{"size":16,"count":1},{"size":17,"count":2},{"size":19,"count":1},{"size":21,"count":1},{"size":23,"count":1},{"size":25,"count":1},{"size":27,"count":1},{"size":29,"count":1},{"size":31,"count":1},{"size":33,"count":1}]
Minimum variable degree0
Maximum variable degree16
Distribution of variable degrees[{"degree":0,"count":120},{"degree":2,"count":168},{"degree":16,"count":17}]
Minimum constraint arity2
Maximum constraint arity17
Distribution of constraint arities[{"arity":2,"count":17},{"arity":3,"count":137},{"arity":4,"count":1},{"arity":5,"count":1},{"arity":6,"count":1},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":9,"count":1},{"arity":10,"count":1},{"arity":11,"count":1},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":1},{"arity":16,"count":1},{"arity":17,"count":1}]
Number of extensional constraints0
Number of intensional constraints152
Distribution of constraint types[{"type":"intension","count":152},{"type":"sum","count":16}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407647OPT32 26.99 26.9917
cosoco 2.0 (complete)4408738OPT32 35.725 35.7302
cosoco 2.0 (complete)4397478OPT32 36.0164 36.0175
cosoco 2 (complete)4394726OPT32 36.5854 36.5905

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: 32
Solution found:
<instantiation> <list> c[] y[][] x[] s[]  </list> <values> 2 1 0 -1 -2 -1 -2 -1 2 -1 -2 -1 2 1 0 -1  -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1
-1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1
-1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1
1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1
1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1  -1 1 1 -1 -1 1
-1 1 -1 -1 -1 -1 -1 -1 1 1 1  4 1 0 1 4 1 4 1 4 1 4 1 4 1 0 1   </values> </instantiation>