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

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

Jump to solvers results

General information on the benchmark

NameGolombRuler/
GolombRuler-a3v18-14_c18.xml
MD5SUMc1878b2d9e06b3112b686731368ac8cc
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark140
Best CPU time to get the best result obtained on this benchmark250.339
Satisfiable
(Un)Satisfiability was proved
Number of variables210
Number of constraints92
Number of domains2
Minimum domain size196
Maximum domain size197
Distribution of domain sizes[{"size":196,"count":91},{"size":197,"count":14}]
Minimum variable degree0
Maximum variable degree14
Distribution of variable degrees[{"degree":0,"count":105},{"degree":2,"count":91},{"degree":13,"count":13},{"degree":14,"count":1}]
Minimum constraint arity3
Maximum constraint arity91
Distribution of constraint arities[{"arity":3,"count":91},{"arity":91,"count":1}]
Number of extensional constraints0
Number of intensional constraints91
Distribution of constraint types[{"type":"intension","count":91},{"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-17 (complete)4312191SAT140 250.339 247.362
Concrete 3.9.2 (complete)4302355SAT (TO)140 252.075 241.144
Mistral-2.0 2018-08-01 (complete)4312640SAT (TO)141 252.003 252.01
cosoco 1.12 (complete)4301824SAT (TO)146 252.008 252.01
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309981SAT148 250.247 247.364
Concrete 3.9.2-SuperNG (complete)4302705SAT (TO)148 252.071 240.736
OscaR - Hybrid 2018-08-14 (complete)4310331SAT (TO)148 252.086 246.618
Choco-solver 4.0.7b seq (e747e1e) (complete)4301822SAT (TO)166 252.061 248.122
Sat4j-CSP 2018-07-11 (complete)4301823? (TO) 252.083 239.434

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: 140
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] x[11] x[12] x[13] 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[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[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[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[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[5][6] y[5][7] y[5][8] y[5][9] y[5][10] y[5][11] y[5][12] y[5][13] y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[6][12] y[6][13]
y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[9][10] y[9][11] y[9][12] y[9][13]
y[10][11] y[10][12] y[10][13] y[11][12] y[11][13] y[12][13] </list> <values> 0 5 7 16 29 35 56 60 68 102 122 125 139 140 5 7 16 29 35 56 60
68 102 122 125 139 140 2 11 24 30 51 55 63 97 117 120 134 135 9 22 28 49 53 61 95 115 118 132 133 13 19 40 44 52 86 106 109 123 124 6 27 31
39 73 93 96 110 111 21 25 33 67 87 90 104 105 4 12 46 66 69 83 84 8 42 62 65 79 80 34 54 57 71 72 20 23 37 38 3 17 18 14 15 1 </values>
</instantiation>