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

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

Jump to solvers results

General information on the benchmark

NameGolombRuler/
GolombRuler-a3v18-15_c18.xml
MD5SUM9d47b2b78bc459aa217a94cfbd52e9d7
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark165
Best CPU time to get the best result obtained on this benchmark252.079
Satisfiable
(Un)Satisfiability was proved
Number of variables240
Number of constraints106
Number of domains2
Minimum domain size225
Maximum domain size226
Distribution of domain sizes[{"size":225,"count":105},{"size":226,"count":15}]
Minimum variable degree0
Maximum variable degree15
Distribution of variable degrees[{"degree":0,"count":120},{"degree":2,"count":105},{"degree":14,"count":14},{"degree":15,"count":1}]
Minimum constraint arity3
Maximum constraint arity105
Distribution of constraint arities[{"arity":3,"count":105},{"arity":105,"count":1}]
Number of extensional constraints0
Number of intensional constraints105
Distribution of constraint types[{"type":"intension","count":105},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Concrete 3.9.2 (complete)4302356SAT (TO)165 252.079 240.738
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312192SAT171 250.416 247.373
Mistral-2.0 2018-08-01 (complete)4312643SAT (TO)171 251.976 252.01
Concrete 3.9.2-SuperNG (complete)4302706SAT (TO)173 252.133 239.748
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309982SAT177 250.213 247.378
OscaR - Hybrid 2018-08-14 (complete)4310332SAT (TO)177 252.106 246.826
cosoco 1.12 (complete)4301833SAT (TO)181 252.039 252.01
Choco-solver 4.0.7b seq (e747e1e) (complete)4301831SAT (TO)200 252.108 247.624
Sat4j-CSP 2018-07-11 (complete)4301832? (TO) 252.104 235.137

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: 165
Solution found:
<instantiation cost="165"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] 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[0][11] y[0][12] y[0][13] y[0][14] 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[1][11] y[1][12] y[1][13] y[1][14] 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[2][11]
y[2][12] y[2][13] y[2][14] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[3][10] y[3][11] y[3][12] y[3][13] y[3][14] y[4][5] y[4][6]
y[4][7] y[4][8] y[4][9] y[4][10] y[4][11] y[4][12] y[4][13] y[4][14] y[5][6] y[5][7] y[5][8] y[5][9] y[5][10] y[5][11] y[5][12] y[5][13]
y[5][14] y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[6][12] y[6][13] y[6][14] y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[7][14]
y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[8][14] y[9][10] y[9][11] y[9][12] y[9][13] y[9][14] y[10][11] y[10][12] y[10][13] y[10][14]
y[11][12] y[11][13] y[11][14] y[12][13] y[12][14] y[13][14] </list> <values> 0 3 15 17 46 54 64 65 98 120 133 140 156 161 165 3 15 17 46 54
64 65 98 120 133 140 156 161 165 12 14 43 51 61 62 95 117 130 137 153 158 162 2 31 39 49 50 83 105 118 125 141 146 150 29 37 47 48 81 103
116 123 139 144 148 8 18 19 52 74 87 94 110 115 119 10 11 44 66 79 86 102 107 111 1 34 56 69 76 92 97 101 33 55 68 75 91 96 100 22 35 42 58
63 67 13 20 36 41 45 7 23 28 32 16 21 25 5 9 4 </values> </instantiation>