2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
GolombRuler/GolombRuler-a3-s1/
GolombRuler-07-a3.xml

Jump to solvers results

General information on the benchmark

NameGolombRuler/GolombRuler-a3-s1/
GolombRuler-07-a3.xml
MD5SUM7dfd3f139f05fe96cee61268ac0efa79
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark25
Best CPU time to get the best result obtained on this benchmark0.087433003
Satisfiable
(Un)Satisfiability was proved
Number of variables56
Number of constraints24
Number of domains2
Minimum domain size500
Maximum domain size501
Distribution of domain sizes[{"size":500,"count":21},{"size":501,"count":7}]
Minimum variable degree0
Maximum variable degree8
Distribution of variable degrees[{"degree":0,"count":28},{"degree":2,"count":21},{"degree":7,"count":5},{"degree":8,"count":2}]
Minimum constraint arity1
Maximum constraint arity21
Distribution of constraint arities[{"arity":1,"count":1},{"arity":3,"count":21},{"arity":7,"count":1},{"arity":21,"count":1}]
Number of extensional constraints0
Number of intensional constraints22
Distribution of constraint types[{"type":"intension","count":22},{"type":"allDifferent","count":1},{"type":"ordered","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 2017-07-28 (complete)4258982OPT25 0.087433003 0.18618999
cosoco-sat 1.12 (complete)4266660OPT25 2.0992401 2.10063
choco-solver 4.0.5 seq (2017-08-18) (complete)4282811OPT25 2.21053 0.90946901
cosoco 1.12 (complete)4268591OPT25 2.21384 2.31036
choco-solver 4.0.5 seq (2017-08-09) (complete)4270061OPT25 2.2163401 1.06411
cosoco 1.1 (complete)4258485OPT25 2.21683 2.32389
OscaR - Hybrid 2017-07-26 (complete)4256497OPT25 2.2202001 1.16892
OscaR - Conflict Ordering 2017-07-26 (complete)4256000OPT25 2.25488 1.1636
choco-solver 4.0.5 seq (2017-07-26) (complete)4254012OPT25 2.2807701 1.03787
choco-solver 4.0.5 par (2017-08-09) (complete)4271531OPT25 2.71716 0.80949098
choco-solver 4.0.5 par (2017-08-18) (complete)4281341OPT25 2.8659501 0.83315098
choco-solver 4.0.5 par (2017-07-26) (complete)4254509OPT25 2.9948399 0.992553
choco-solver 5a (2017-07-26) (complete)4255006OPT25 5.79528 2.35253
choco-solver 5a (2017-08-18) (complete)4284281OPT25 5.8688898 2.2277701
Concrete 3.4 (complete)4259479OPT25 10.2233 4.5421801
OscaR - Parallel with EPS 2017-07-26 (complete)4256994OPT25 13.0668 4.1311302
OscaR - Parallel with EPS 2017-08-22 (complete)4285751OPT25 14.7568 4.6995602
sat4j-CSP 2017-07-05 (complete)4257988OPT25 58.416801 36.663399
AbsCon-basic 2017-06-11 (complete)4257491OPT25 125.184 123.303
OscaR - ALNS 2017-07-26 (complete)4255503SAT (TO)25 247.55099 240.01401

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: 25
Solution found:
<instantiation type="optimum" cost="25"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6]
y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[3][0] y[3][1] y[3][2]
y[3][3] y[3][4] y[3][5] y[3][6] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5]
y[5][6] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] </list> <values> 0 1 4 10 18 23 25 * 1 4 10 18 23 25 * * 3 9 17 22 24 * * *
6 14 19 21 * * * * 8 13 15 * * * * * 5 7 * * * * * * 2 * * * * * * * </values> </instantiation>