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

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

Jump to solvers results

General information on the benchmark

NameGolombRuler/
GolombRuler-a3v18-nodv-10_c18.xml
MD5SUM769ec0f26c47f1b96bb609b2e4d8d5d6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark55
Best CPU time to get the best result obtained on this benchmark174.462
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints46
Number of domains2
Minimum domain size100
Maximum domain size101
Distribution of domain sizes[{"size":100,"count":45},{"size":101,"count":10}]
Minimum variable degree0
Maximum variable degree10
Distribution of variable degrees[{"degree":0,"count":55},{"degree":2,"count":45},{"degree":9,"count":9},{"degree":10,"count":1}]
Minimum constraint arity3
Maximum constraint arity45
Distribution of constraint arities[{"arity":3,"count":45},{"arity":45,"count":1}]
Number of extensional constraints0
Number of intensional constraints45
Distribution of constraint types[{"type":"intension","count":45},{"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)4312638OPT55 12.6632 12.6638
cosoco 1.12 (complete)4301818OPT55 174.462 174.441
Choco-solver 4.0.7b seq (e747e1e) (complete)4301816SAT (TO)59 252.12 247.713
Concrete 3.9.2 (complete)4302359SAT (TO)60 252.142 241.741
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312195SAT61 250.036 247.371
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309985SAT61 250.133 247.374
Concrete 3.9.2-SuperNG (complete)4302709SAT (TO)61 252.074 240.338
OscaR - Hybrid 2018-08-14 (complete)4310335SAT (TO)64 252.061 246.136
Sat4j-CSP 2018-07-11 (complete)4301817SAT (TO)64 252.088 247.42

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: 55
Solution found:
<instantiation type="optimum" cost="55"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] 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[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[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[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[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[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[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[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[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[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] </list> <values> 0 1 6 10 23 26 34 41 53 55 * 1 6 10 23 26
34 41 53 55 * * 5 9 22 25 33 40 52 54 * * * 4 17 20 28 35 47 49 * * * * 13 16 24 31 43 45 * * * * * 3 11 18 30 32 * * * * * * 8 15 27 29 * *
* * * * * 7 19 21 * * * * * * * * 12 14 * * * * * * * * * 2 * * * * * * * * * * </values> </instantiation>