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

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

Jump to solvers results

General information on the benchmark

NameLowAutocorrelation/LowAutocorrelation-m1-s1/
LowAutocorrelation-013.xml
MD5SUMb76e3dd835cfa29a148b2c7537ac72a3
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark6
Best CPU time to get the best result obtained on this benchmark0.314731
Satisfiable
(Un)Satisfiability was proved
Number of variables181
Number of constraints102
Number of domains25
Minimum domain size2
Maximum domain size25
Distribution of domain sizes[{"size":2,"count":92},{"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":15,"count":1},{"size":17,"count":1},{"size":19,"count":1},{"size":21,"count":1},{"size":23,"count":1},{"size":25,"count":1}]
Minimum variable degree0
Maximum variable degree12
Distribution of variable degrees[{"degree":0,"count":66},{"degree":2,"count":102},{"degree":12,"count":13}]
Minimum constraint arity2
Maximum constraint arity13
Distribution of constraint arities[{"arity":2,"count":13},{"arity":3,"count":79},{"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}]
Number of extensional constraints0
Number of intensional constraints90
Distribution of constraint types[{"type":"intension","count":90},{"type":"sum","count":12}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Naxos 1.1.0 (complete)4252697OPT6 0.314731 0.31461
cosoco-mini 1.1 (2017-07-29) (complete)4259898OPT6 0.44926599 0.49462599
cosoco-mini 1.1 (2017-06-27) (complete)4252696OPT6 0.452296 0.452978
cosoco-mini 1.12 (complete)4267079OPT6 0.45936701 0.46101999

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: 6
Solution found:
<instantiation> <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] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5]
y[0][6] y[0][7] y[0][8] y[0][9] y[0][10] y[0][11] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[1][9] y[1][10]
y[1][11] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[2][10] y[2][11] y[3][0] y[3][1] y[3][2] y[3][3]
y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[3][10] y[3][11] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8]
y[4][9] y[4][10] y[4][11] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] y[5][8] y[5][9] y[5][10] y[5][11] y[6][0] y[6][1]
y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[7][0] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6]
y[7][7] y[7][8] y[7][9] y[7][10] y[7][11] y[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] y[8][9] y[8][10] y[8][11]
y[9][0] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[9][8] y[9][9] y[9][10] y[9][11] y[10][0] y[10][1] y[10][2] y[10][3]
y[10][4] y[10][5] y[10][6] y[10][7] y[10][8] y[10][9] y[10][10] y[10][11] y[11][0] y[11][1] y[11][2] y[11][3] y[11][4] y[11][5] y[11][6]
y[11][7] y[11][8] y[11][9] y[11][10] y[11][11] c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] s[0] s[1] s[2] s[3] s[4] s[5]
s[6] s[7] s[8] s[9] s[10] s[11] </list> <values> -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 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 </values> </instantiation>