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

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

Jump to solvers results

General information on the benchmark

NameLowAutocorrelation/LowAutocorrelation-m1-s1/
LowAutocorrelation-004.xml
MD5SUMb220eda080bc853662ea3d9fecf431a6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark0.013727
Satisfiable
(Un)Satisfiability was proved
Number of variables19
Number of constraints12
Number of domains7
Minimum domain size2
Maximum domain size7
Distribution of domain sizes[{"size":2,"count":11},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":1},{"size":7,"count":1}]
Minimum variable degree0
Maximum variable degree3
Distribution of variable degrees[{"degree":0,"count":3},{"degree":2,"count":12},{"degree":3,"count":4}]
Minimum constraint arity2
Maximum constraint arity4
Distribution of constraint arities[{"arity":2,"count":4},{"arity":3,"count":7},{"arity":4,"count":1}]
Number of extensional constraints0
Number of intensional constraints9
Distribution of constraint types[{"type":"intension","count":9},{"type":"sum","count":3}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco-mini 1.12 (complete)4267077OPT2 0.013727 0.0148089
cosoco-mini 1.1 (2017-06-27) (complete)4252700OPT2 0.014007 0.015633
cosoco-mini 1.1 (2017-07-29) (complete)4259896OPT2 0.014434 0.078281902
Naxos 1.1.0 (complete)4252701OPT2 0.019408 0.0200449

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