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

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

Jump to solvers results

General information on the benchmark

NameGolombRuler/GolombRuler-a3-s1/
GolombRuler-08-a3.xml
MD5SUM86f9a0f9696ddea7c71528c4cbe59182
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark34
Best CPU time to get the best result obtained on this benchmark0.33681199
Satisfiable
(Un)Satisfiability was proved
Number of variables72
Number of constraints31
Number of domains2
Minimum domain size500
Maximum domain size501
Distribution of domain sizes[{"size":500,"count":28},{"size":501,"count":8}]
Minimum variable degree0
Maximum variable degree9
Distribution of variable degrees[{"degree":0,"count":36},{"degree":2,"count":28},{"degree":8,"count":6},{"degree":9,"count":2}]
Minimum constraint arity1
Maximum constraint arity28
Distribution of constraint arities[{"arity":1,"count":1},{"arity":3,"count":28},{"arity":8,"count":1},{"arity":28,"count":1}]
Number of extensional constraints0
Number of intensional constraints29
Distribution of constraint types[{"type":"intension","count":29},{"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)4258983OPT34 0.33681199 0.422968
OscaR - Conflict Ordering 2017-07-26 (complete)4256001OPT34 2.9279799 1.39473
OscaR - Hybrid 2017-07-26 (complete)4256498OPT34 2.9649701 1.3744
choco-solver 4.0.5 par (2017-07-26) (complete)4254510OPT34 6.0815802 1.33496
choco-solver 4.0.5 par (2017-08-18) (complete)4281342OPT34 6.2099299 1.2918
choco-solver 4.0.5 par (2017-08-09) (complete)4271532OPT34 6.6123199 1.3452801
choco-solver 4.0.5 seq (2017-08-18) (complete)4282812OPT34 6.6598101 3.2251599
choco-solver 4.0.5 seq (2017-07-26) (complete)4254013OPT34 6.8036599 3.3973899
choco-solver 4.0.5 seq (2017-08-09) (complete)4270062OPT34 7.2101102 3.6979599
Concrete 3.4 (complete)4259480OPT34 11.8226 5.1969099
OscaR - Parallel with EPS 2017-07-26 (complete)4256995OPT34 17.370501 5.1996198
OscaR - Parallel with EPS 2017-08-22 (complete)4285752OPT34 17.9715 5.1612401
cosoco-sat 1.12 (complete)4266661OPT34 18.7679 18.7712
cosoco 1.1 (complete)4258486OPT34 22.6828 22.7638
cosoco 1.12 (complete)4268592OPT34 22.814899 22.894699
choco-solver 5a (2017-07-26) (complete)4255007OPT34 37.707901 29.8685
choco-solver 5a (2017-08-18) (complete)4284282OPT34 38.889999 30.317301
sat4j-CSP 2017-07-05 (complete)4257989OPT34 215.517 183.04201
AbsCon-basic 2017-06-11 (complete)4257492SAT (TO)34 242.214 240.011
OscaR - ALNS 2017-07-26 (complete)4255504SAT (TO)34 247.914 240.021

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