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

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

Jump to solvers results

General information on the benchmark

NameLowAutocorrelation/LowAutocorrelation-m1-s1/
LowAutocorrelation-006.xml
MD5SUM4af01ce06b730b4761acd70e4153220a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark7
Best CPU time to get the best result obtained on this benchmark0.012319
Satisfiable
(Un)Satisfiability was proved
Number of variables41
Number of constraints25
Number of domains11
Minimum domain size2
Maximum domain size11
Distribution of domain sizes[{"size":2,"count":22},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":1},{"size":9,"count":1},{"size":11,"count":1}]
Minimum variable degree0
Maximum variable degree5
Distribution of variable degrees[{"degree":0,"count":10},{"degree":2,"count":25},{"degree":5,"count":6}]
Minimum constraint arity2
Maximum constraint arity6
Distribution of constraint arities[{"arity":2,"count":6},{"arity":3,"count":16},{"arity":4,"count":1},{"arity":5,"count":1},{"arity":6,"count":1}]
Number of extensional constraints0
Number of intensional constraints20
Distribution of constraint types[{"type":"intension","count":20},{"type":"sum","count":5}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.0 (complete)4397484OPT7 0.012319 0.013461
cosoco 2 (complete)4394719OPT7 0.012571 0.0143669
cosoco 2.0 (complete)4408744OPT7 0.014385 0.0151901
(reference) PicatSAT 2019-09-12 (complete)4407640OPT7 0.098963 0.0993961

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: 7
Solution found:
<instantiation type='solution' cost='7'> <list>c[0] c[1] c[2] c[3] c[4] s[0] s[1] s[2] s[3] s[4] x[0] x[1] x[2] x[3] x[4] x[5] y[0][0]
y[0][1] y[0][2] y[0][3] y[0][4] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[3][0] y[3][1] y[3][2]
y[3][3] y[3][4] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] </list> <values>-1 2 -1 0 -1 1 4 1 0 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 * -1 1
-1 * * 1 -1 * * * -1 * * * * </values> </instantiation>