2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
LowAutocorrelation/
LowAutocorrelation-025_c18.xml

Jump to solvers results

General information on the benchmark

NameLowAutocorrelation/
LowAutocorrelation-025_c18.xml
MD5SUM7b538560589303b25b02d7fceaa25241
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark36
Best CPU time to get the best result obtained on this benchmark68.3581
Satisfiable
(Un)Satisfiability was proved
Number of variables649
Number of constraints348
Number of domains49
Minimum domain size2
Maximum domain size49
Distribution of domain sizes[{"size":2,"count":326},{"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":18,"count":1},{"size":19,"count":2},{"size":20,"count":1},{"size":21,"count":2},{"size":22,"count":1},{"size":23,"count":2},{"size":24,"count":1},{"size":25,"count":2},{"size":27,"count":1},{"size":29,"count":1},{"size":31,"count":1},{"size":33,"count":1},{"size":35,"count":1},{"size":37,"count":1},{"size":39,"count":1},{"size":41,"count":1},{"size":43,"count":1},{"size":45,"count":1},{"size":47,"count":1},{"size":49,"count":1}]
Minimum variable degree0
Maximum variable degree24
Distribution of variable degrees[{"degree":0,"count":276},{"degree":2,"count":348},{"degree":24,"count":25}]
Minimum constraint arity2
Maximum constraint arity25
Distribution of constraint arities[{"arity":2,"count":25},{"arity":3,"count":301},{"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},{"arity":18,"count":1},{"arity":19,"count":1},{"arity":20,"count":1},{"arity":21,"count":1},{"arity":22,"count":1},{"arity":23,"count":1},{"arity":24,"count":1},{"arity":25,"count":1}]
Number of extensional constraints0
Number of intensional constraints324
Distribution of constraint types[{"type":"intension","count":324},{"type":"sum","count":24}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2018-08-14 (complete)4309552OPT36 68.3581 68.3674
PicatSAT 2018-08-02 (complete)4303212OPT36 80.076 80.0781
PicatSAT 2018-06-15 (complete)4294811OPT36 95.3056 95.3058
Mistral-2.0 2018-06-15 (complete)4289532OPT36 483.191 483.222
Mistral-2.0 2018-08-01 (complete)4303798OPT36 488.95 488.965
Sat4j-CSP 2018-07-11 (complete)4289999OPT36 741.95 738.902
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290486SAT (TO)36 2400.04 2356.02
OscaR - Hybrid 2018-07-02 (complete)4291684SAT (TO)36 2400.1 2353.71
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311766SAT (TO)36 2520.04 2475.71
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308030SAT (TO)36 2520.04 2476.51
Concrete 3.9.2 (complete)4304575SAT (TO)36 2520.06 2463.14
Concrete 3.8 2018-06-13 (complete)4294808SAT (TO)36 2520.07 2463.73
Concrete 3.9.2-SuperNG (complete)4304576SAT (TO)36 2520.09 2462.83
Choco-solver 4.0.7 seq (493a269) (complete)4292442SAT (TO)44 2400.07 2391.91
Choco-solver 4.0.7b seq (e747e1e) (complete)4306736SAT (TO)44 2520.04 2511.71
OscaR - Hybrid 2018-08-14 (complete)4308616SAT (TO)44 2520.09 2456.02
cosoco 1.12 (complete)4294810SAT (TO)48 2519.94 2520.01
Concrete 3.8-SuperNG 2018-06-13 (complete)4294809SAT (TO)48 2520.09 2463.54

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