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

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

Jump to solvers results

General information on the benchmark

NameGolombRuler/
GolombRuler-a3v18-nodv-11_c18.xml
MD5SUMd48530cddaac7c3de8b9754209410058
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark75
Best CPU time to get the best result obtained on this benchmark252.13
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
Mistral-2.0 2018-08-01 (complete)4312648SAT (TO)72 251.976 252.01
Concrete 3.9.2 (complete)4302360SAT (TO)75 252.13 241.838
cosoco 1.12 (complete)4301848SAT (TO)76 252.021 252.01
Choco-solver 4.0.7b seq (e747e1e) (complete)4301846SAT (TO)78 252.11 247.713
Concrete 3.9.2-SuperNG (complete)4302710SAT (TO)80 252.125 240.737
OscaR - Hybrid 2018-08-14 (complete)4310336SAT (TO)84 252.064 244.727
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312196SAT85 250.209 247.363
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309986SAT88 250.243 247.367
Sat4j-CSP 2018-07-11 (complete)4301847SAT (TO)95 252.173 246.52

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