2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameLowAutocorrelation/LowAutocorrelation-m1-s1/
LowAutocorrelation-011.xml
MD5SUMf63a1d69196369b30b13838bf3675f5d
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark5
Best CPU time to get the best result obtained on this benchmark0.12828501
Satisfiable
(Un)Satisfiability was proved
Number of variables131
Number of constraints75
Number of domains21
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":67},{"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":13,"count":1},{"size":15,"count":1},{"size":17,"count":1},{"size":19,"count":1},{"size":21,"count":1}]
Minimum variable degree0
Maximum variable degree10
Distribution of variable degrees[{"degree":0,"count":45},{"degree":2,"count":75},{"degree":10,"count":11}]
Minimum constraint arity2
Maximum constraint arity11
Distribution of constraint arities[{"arity":2,"count":11},{"arity":3,"count":56},{"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}]
Number of extensional constraints0
Number of intensional constraints65
Distribution of constraint types[{"type":"intension","count":65},{"type":"sum","count":10}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco-sat 1.12 (complete)4266727OPT5 0.12828501 0.12920199
cosoco 1.1 (complete)4258552OPT5 0.144962 0.198359
cosoco 1.12 (complete)4268658OPT5 0.147266 0.248208
Mistral-2.0 2017-07-28 (complete)4259049OPT5 0.157014 0.20953
sat4j-CSP 2017-07-05 (complete)4258055OPT5 1.12146 0.87440199
choco-solver 4.0.5 seq (2017-08-18) (complete)4282878OPT5 1.46911 0.66519701
choco-solver 4.0.5 seq (2017-07-26) (complete)4254079OPT5 1.48738 0.80377001
choco-solver 4.0.5 seq (2017-08-09) (complete)4270128OPT5 1.49754 0.81514502
OscaR - Conflict Ordering 2017-07-26 (complete)4256067OPT5 1.5152 0.97933602
OscaR - Hybrid 2017-07-26 (complete)4256564OPT5 1.52817 0.931566
AbsCon-basic 2017-06-11 (complete)4257558OPT5 1.9227 0.96687901
choco-solver 4.0.5 par (2017-08-09) (complete)4271598OPT5 2.61061 0.87278497
choco-solver 4.0.5 par (2017-08-18) (complete)4281408OPT5 2.8275399 0.905527
choco-solver 4.0.5 par (2017-07-26) (complete)4254576OPT5 2.9435201 1.08191
choco-solver 5a (2017-07-26) (complete)4255073OPT5 4.3485398 1.69063
choco-solver 5a (2017-08-18) (complete)4284348OPT5 4.34974 1.63126
OscaR - Parallel with EPS 2017-07-26 (complete)4257061OPT5 6.3362498 2.0887899
OscaR - Parallel with EPS 2017-08-22 (complete)4285818OPT5 6.7199702 1.98329
Concrete 3.4 (complete)4259546OPT5 10.0332 4.5994401
OscaR - ALNS 2017-07-26 (complete)4255570SAT (TO)5 248.06 240.026

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