2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
GolombRuler/
GolombRuler-a3v18-11_c18.xml

Jump to solvers results

General information on the benchmark

NameGolombRuler/
GolombRuler-a3v18-11_c18.xml
MD5SUMed3f9a47d1f1ba76ff72e7160e212ad4
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark72
Best CPU time to get the best result obtained on this benchmark249.995
Satisfiable
(Un)Satisfiability was proved
Number of variables132
Number of constraints56
Number of domains2
Minimum domain size121
Maximum domain size122
Distribution of domain sizes[{"size":121,"count":55},{"size":122,"count":11}]
Minimum variable degree0
Maximum variable degree11
Distribution of variable degrees[{"degree":0,"count":66},{"degree":2,"count":55},{"degree":10,"count":10},{"degree":11,"count":1}]
Minimum constraint arity3
Maximum constraint arity55
Distribution of constraint arities[{"arity":3,"count":55},{"arity":55,"count":1}]
Number of extensional constraints0
Number of intensional constraints55
Distribution of constraint types[{"type":"intension","count":55},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309978SAT72 249.995 247.361
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312188SAT72 250.176 247.367
cosoco 1.12 (complete)4301815SAT (TO)72 251.948 252.01
Mistral-2.0 2018-08-01 (complete)4312637SAT (TO)72 251.999 252.01
Concrete 3.9.2 (complete)4302352SAT (TO)72 252.12 241.639
Concrete 3.9.2-SuperNG (complete)4302702SAT (TO)72 252.125 238.845
OscaR - Hybrid 2018-08-14 (complete)4310328SAT (TO)77 252.088 244.926
Choco-solver 4.0.7b seq (e747e1e) (complete)4301813SAT (TO)78 252.09 247.913
Sat4j-CSP 2018-07-11 (complete)4301814SAT (TO)95 252.071 245.82

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: 72
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] 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[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[2][3] y[2][4] y[2][5] y[2][6] y[2][7]
y[2][8] y[2][9] y[2][10] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[3][10] y[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[4][10] y[5][6]
y[5][7] y[5][8] y[5][9] y[5][10] y[6][7] y[6][8] y[6][9] y[6][10] y[7][8] y[7][9] y[7][10] y[8][9] y[8][10] y[9][10] </list> <values> 0 2 8
18 25 39 44 59 68 71 72 2 8 18 25 39 44 59 68 71 72 6 16 23 37 42 57 66 69 70 10 17 31 36 51 60 63 64 7 21 26 41 50 53 54 14 19 34 43 46 47
5 20 29 32 33 15 24 27 28 9 12 13 3 4 1 </values> </instantiation>