2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
TravelingTournament/
TravelingTournament-a2-galaxy08_c18.xml

Jump to solvers results

General information on the benchmark

NameTravelingTournament/
TravelingTournament-a2-galaxy08_c18.xml
MD5SUM909adc3d6f12c1302971d5fd30a3af0f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark3179
Best CPU time to get the best result obtained on this benchmark2520.05
Satisfiable
(Un)Satisfiability was proved
Number of variables456
Number of constraints1111
Number of domains3
Minimum domain size2
Maximum domain size24
Distribution of domain sizes[{"size":2,"count":224},{"size":8,"count":112},{"size":24,"count":120}]
Minimum variable degree2
Maximum variable degree26
Distribution of variable degrees[{"degree":2,"count":232},{"degree":23,"count":96},{"degree":24,"count":112},{"degree":25,"count":14},{"degree":26,"count":2}]
Minimum constraint arity2
Maximum constraint arity14
Distribution of constraint arities[{"arity":2,"count":113},{"arity":3,"count":16},{"arity":4,"count":624},{"arity":5,"count":104},{"arity":8,"count":126},{"arity":10,"count":112},{"arity":14,"count":16}]
Number of extensional constraints120
Number of intensional constraints737
Distribution of constraint types[{"type":"extension","count":120},{"type":"intension","count":737},{"type":"regular","count":8},{"type":"allDifferent","count":14},{"type":"cardinality","count":8},{"type":"element","count":224}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Concrete 3.9.2 (complete)4304717SAT (TO)3179 2520.05 2455.73
Mistral-2.0 2018-06-15 (complete)4289644SAT (TO)3188 2400.02 2400.01
Concrete 3.8-SuperNG 2018-06-13 (complete)4295462SAT (TO)3193 2520.09 2468.45
OscaR - Hybrid 2018-07-02 (complete)4291496SAT (TO)3242 2400.12 2363.14
Choco-solver 4.0.7 seq (493a269) (complete)4292254SAT (TO)3246 2400.05 2390.52
Choco-solver 4.0.7b seq (e747e1e) (complete)4306548SAT (TO)3246 2520.02 2511.02
Concrete 3.8 2018-06-13 (complete)4295461SAT (TO)3252 2520.07 2455.83
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311578SAT (TO)3261 2520.04 2469.82
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290298SAT (TO)3272 2400.07 2350.21
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307842SAT (TO)3288 2520.1 2468.62
OscaR - Hybrid 2018-08-14 (complete)4308428SAT (TO)3343 2520.05 2482.32
Concrete 3.9.2-SuperNG (complete)4304718SAT (TO)3344 2520.11 2469.83
Sat4j-CSP 2018-07-11 (complete)4289811SAT (TO)3544 2400.19 2384.94
cosoco 1.12 (complete)4295463? (NS) 0.00682 0.00766692
PicatSAT 2018-08-14 (complete)4309364? (TO) 2520.04 2519.9
PicatSAT 2018-06-15 (complete)4295464? (TO) 2520.05 2520.01
PicatSAT 2018-08-02 (complete)4303024? (TO) 2520.09 2519.8
Mistral-2.0 2018-08-01 (complete)4303610Signal 0.380879 6.48767

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: 3179
Solution found:
<instantiation cost="3179"> <list> o[0][0] o[0][1] o[0][2] o[0][3] o[0][4] o[0][5] o[0][6] o[0][7] o[0][8] o[0][9] o[0][10] o[0][11]
o[0][12] o[0][13] o[1][0] o[1][1] o[1][2] o[1][3] o[1][4] o[1][5] o[1][6] o[1][7] o[1][8] o[1][9] o[1][10] o[1][11] o[1][12] o[1][13]
o[2][0] o[2][1] o[2][2] o[2][3] o[2][4] o[2][5] o[2][6] o[2][7] o[2][8] o[2][9] o[2][10] o[2][11] o[2][12] o[2][13] o[3][0] o[3][1] o[3][2]
o[3][3] o[3][4] o[3][5] o[3][6] o[3][7] o[3][8] o[3][9] o[3][10] o[3][11] o[3][12] o[3][13] o[4][0] o[4][1] o[4][2] o[4][3] o[4][4] o[4][5]
o[4][6] o[4][7] o[4][8] o[4][9] o[4][10] o[4][11] o[4][12] o[4][13] o[5][0] o[5][1] o[5][2] o[5][3] o[5][4] o[5][5] o[5][6] o[5][7] o[5][8]
o[5][9] o[5][10] o[5][11] o[5][12] o[5][13] o[6][0] o[6][1] o[6][2] o[6][3] o[6][4] o[6][5] o[6][6] o[6][7] o[6][8] o[6][9] o[6][10]
o[6][11] o[6][12] o[6][13] o[7][0] o[7][1] o[7][2] o[7][3] o[7][4] o[7][5] o[7][6] o[7][7] o[7][8] o[7][9] o[7][10] o[7][11] o[7][12]
o[7][13] h[0][0] h[0][1] h[0][2] h[0][3] h[0][4] h[0][5] h[0][6] h[0][7] h[0][8] h[0][9] h[0][10] h[0][11] h[0][12] h[0][13] h[1][0] h[1][1]
h[1][2] h[1][3] h[1][4] h[1][5] h[1][6] h[1][7] h[1][8] h[1][9] h[1][10] h[1][11] h[1][12] h[1][13] h[2][0] h[2][1] h[2][2] h[2][3] h[2][4]
h[2][5] h[2][6] h[2][7] h[2][8] h[2][9] h[2][10] h[2][11] h[2][12] h[2][13] h[3][0] h[3][1] h[3][2] h[3][3] h[3][4] h[3][5] h[3][6] h[3][7]
h[3][8] h[3][9] h[3][10] h[3][11] h[3][12] h[3][13] h[4][0] h[4][1] h[4][2] h[4][3] h[4][4] h[4][5] h[4][6] h[4][7] h[4][8] h[4][9] h[4][10]
h[4][11] h[4][12] h[4][13] h[5][0] h[5][1] h[5][2] h[5][3] h[5][4] h[5][5] h[5][6] h[5][7] h[5][8] h[5][9] h[5][10] h[5][11] h[5][12]
h[5][13] h[6][0] h[6][1] h[6][2] h[6][3] h[6][4] h[6][5] h[6][6] h[6][7] h[6][8] h[6][9] h[6][10] h[6][11] h[6][12] h[6][13] h[7][0] h[7][1]
h[7][2] h[7][3] h[7][4] h[7][5] h[7][6] h[7][7] h[7][8] h[7][9] h[7][10] h[7][11] h[7][12] h[7][13] a[0][0] a[0][1] a[0][2] a[0][3] a[0][4]
a[0][5] a[0][6] a[0][7] a[0][8] a[0][9] a[0][10] a[0][11] a[0][12] a[0][13] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[1][6] a[1][7]
a[1][8] a[1][9] a[1][10] a[1][11] a[1][12] a[1][13] a[2][0] a[2][1] a[2][2] a[2][3] a[2][4] a[2][5] a[2][6] a[2][7] a[2][8] a[2][9] a[2][10]
a[2][11] a[2][12] a[2][13] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[3][5] a[3][6] a[3][7] a[3][8] a[3][9] a[3][10] a[3][11] a[3][12]
a[3][13] a[4][0] a[4][1] a[4][2] a[4][3] a[4][4] a[4][5] a[4][6] a[4][7] a[4][8] a[4][9] a[4][10] a[4][11] a[4][12] a[4][13] a[5][0] a[5][1]
a[5][2] a[5][3] a[5][4] a[5][5] a[5][6] a[5][7] a[5][8] a[5][9] a[5][10] a[5][11] a[5][12] a[5][13] a[6][0] a[6][1] a[6][2] a[6][3] a[6][4]
a[6][5] a[6][6] a[6][7] a[6][8] a[6][9] a[6][10] a[6][11] a[6][12] a[6][13] a[7][0] a[7][1] a[7][2] a[7][3] a[7][4] a[7][5] a[7][6] a[7][7]
a[7][8] a[7][9] a[7][10] a[7][11] a[7][12] a[7][13] t[0][0] t[0][1] t[0][2] t[0][3] t[0][4] t[0][5] t[0][6] t[0][7] t[0][8] t[0][9] t[0][10]
t[0][11] t[0][12] t[0][13] t[0][14] t[1][0] t[1][1] t[1][2] t[1][3] t[1][4] t[1][5] t[1][6] t[1][7] t[1][8] t[1][9] t[1][10] t[1][11]
t[1][12] t[1][13] t[1][14] t[2][0] t[2][1] t[2][2] t[2][3] t[2][4] t[2][5] t[2][6] t[2][7] t[2][8] t[2][9] t[2][10] t[2][11] t[2][12]
t[2][13] t[2][14] t[3][0] t[3][1] t[3][2] t[3][3] t[3][4] t[3][5] t[3][6] t[3][7] t[3][8] t[3][9] t[3][10] t[3][11] t[3][12] t[3][13]
t[3][14] t[4][0] t[4][1] t[4][2] t[4][3] t[4][4] t[4][5] t[4][6] t[4][7] t[4][8] t[4][9] t[4][10] t[4][11] t[4][12] t[4][13] t[4][14]
t[5][0] t[5][1] t[5][2] t[5][3] t[5][4] t[5][5] t[5][6] t[5][7] t[5][8] t[5][9] t[5][10] t[5][11] t[5][12] t[5][13] t[5][14] t[6][0] t[6][1]
t[6][2] t[6][3] t[6][4] t[6][5] t[6][6] t[6][7] t[6][8] t[6][9] t[6][10] t[6][11] t[6][12] t[6][13] t[6][14] t[7][0] t[7][1] t[7][2] t[7][3]
t[7][4] t[7][5] t[7][6] t[7][7] t[7][8] t[7][9] t[7][10] t[7][11] t[7][12] t[7][13] t[7][14] </list> <values> 5 4 6 1 2 6 3 5 3 4 7 2 1 7 4
7 4 0 6 2 6 7 5 5 2 3 0 3 6 3 7 4 0 1 5 3 4 6 1 0 7 5 7 2 5 6 5 4 0 2 0 7 6 1 4 1 1 0 1 2 7 3 7 6 2 0 5 5 3 6 0 6 3 7 3 7 2 0 1 1 4 4 6 2 2
5 0 3 1 0 1 4 7 2 3 7 5 4 3 1 2 5 4 5 4 1 6 3 0 6 2 0 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 0 1 0 0 1 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 0
1 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 0 1 0 0 1 1 0 0 1 1 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 1 1 0 1 1 0 0 1 1 0 0 1 1 0 0 0
1 1 0 1 0 1 1 0 0 1 0 1 0 1 0 0 1 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 0 0 1 1 0 0 1 1
0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 36 18 44 15 15 34 41 39 0 44 44 10 10 0 31 31 0 10 10 0
39 59 44 40 50 22 0 32 32 0 47 14 56 0 22 22 0 45 18 56 15 15 50 50 14 14 0 47 27 41 0 47 15 34 0 32 31 51 0 0 0 31 22 45 51 14 64 0 36 39
35 0 18 18 39 39 41 14 48 0 50 50 40 40 0 35 18 27 0 56 50 27 0 39 10 44 18 18 0 47 14 59 0 0 0 44 44 0 64 35 48 0 59 47 14 0 56 15 44
</values> </instantiation>