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

Result page for benchmark
TravelingTournament/
TravelingTournament-a3-galaxy06_c18.xml

Jump to solvers results

General information on the benchmark

NameTravelingTournament/
TravelingTournament-a3-galaxy06_c18.xml
MD5SUMf9caa09a77a0aeed2ee1a5d5b0978ec8
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark1401
Best CPU time to get the best result obtained on this benchmark2520.06
Satisfiable
(Un)Satisfiability was proved
Number of variables246
Number of constraints485
Number of domains3
Minimum domain size2
Maximum domain size16
Distribution of domain sizes[{"size":2,"count":120},{"size":6,"count":60},{"size":16,"count":66}]
Minimum variable degree2
Maximum variable degree20
Distribution of variable degrees[{"degree":2,"count":126},{"degree":17,"count":48},{"degree":18,"count":60},{"degree":19,"count":10},{"degree":20,"count":2}]
Minimum constraint arity2
Maximum constraint arity10
Distribution of constraint arities[{"arity":2,"count":61},{"arity":3,"count":12},{"arity":4,"count":216},{"arity":5,"count":54},{"arity":6,"count":70},{"arity":8,"count":60},{"arity":10,"count":12}]
Number of extensional constraints66
Number of intensional constraints277
Distribution of constraint types[{"type":"extension","count":66},{"type":"intension","count":277},{"type":"regular","count":6},{"type":"allDifferent","count":10},{"type":"cardinality","count":6},{"type":"element","count":120}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2018-06-15 (complete)4289639SAT (TO)1397 2400.09 2400.01
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311584SAT (TO)1401 2520.06 2475.41
OscaR - Hybrid 2018-08-14 (complete)4308434SAT (TO)1403 2520.02 2479.51
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307848SAT (TO)1407 2520.07 2476.13
Concrete 3.8 2018-06-13 (complete)4295441SAT (TO)1407 2520.07 2461.04
Concrete 3.9.2-SuperNG (complete)4304708SAT (TO)1413 2520.05 2476.14
Choco-solver 4.0.7 seq (493a269) (complete)4292260SAT (TO)1414 2400.07 2392.71
Choco-solver 4.0.7b seq (e747e1e) (complete)4306554SAT (TO)1414 2520.07 2512.91
Concrete 3.8-SuperNG 2018-06-13 (complete)4295442SAT (TO)1417 2520.09 2475.63
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290304SAT (TO)1419 2400.09 2359.12
Concrete 3.9.2 (complete)4304707SAT (TO)1442 2520.13 2460.83
OscaR - Hybrid 2018-07-02 (complete)4291502SAT (TO)1463 2400.1 2360.02
Sat4j-CSP 2018-07-11 (complete)4289817SAT (TO)1504 2400.17 2389.73
cosoco 1.12 (complete)4295443? (NS) 0.005066 0.0058411
PicatSAT 2018-08-02 (complete)4303030? (TO) 2519.96 2520.02
PicatSAT 2018-06-15 (complete)4295444? (TO) 2520.05 2520.02
PicatSAT 2018-08-14 (complete)4309370? (TO) 2520.06 2520.02
Mistral-2.0 2018-08-01 (complete)4303616Signal 0.1476 1.52433

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: 1397
Solution found:
<instantiation type="solution"> <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[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[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[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[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[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] 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[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[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[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[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[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] 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[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[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[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[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[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] 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[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[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[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[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[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] </list> <values> 1 3 5 3 4 1 2 4 5
2 0 4 3 4 5 0 5 2 2 3 3 5 4 5 3 4 0 1 1 0 2 0 1 0 2 5 4 5 4 1 5 1 2 1 0 2 3 0 3 5 4 2 0 2 1 3 1 3 0 4 0 1 1 0 1 1 1 0 0 0 1 0 1 1 0 0 1 1 0
0 1 1 0 0 0 1 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 1 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 1 1 0
0 1 1 1 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 1 1 1 1 1 0 0 1 1 0 0 0 10 10 0 34 34 0 0 36 35 50 15 0 31 31 0 40 39 10 0 22 47 32 0 0 45 35 41 47 15
10 22 0 0 47 15 10 32 0 0 51 35 41 0 0 0 0 0 31 10 15 45 0 51 41 35 35 45 15 39 0 41 32 40 0 0 0 </values> </instantiation>