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

Result page for benchmark
Tal/
Tal-07_c18.xml

Jump to solvers results

General information on the benchmark

NameTal/
Tal-07_c18.xml
MD5SUM5a4be603cb990ae6ed40c9d9f121c88d
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark150
Best CPU time to get the best result obtained on this benchmark19949.1
Satisfiable
(Un)Satisfiability was proved
Number of variables818
Number of constraints545
Number of domains12
Minimum domain size1
Maximum domain size42
Distribution of domain sizes[{"size":1,"count":135},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":73},{"size":7,"count":9},{"size":8,"count":10},{"size":9,"count":11},{"size":10,"count":67},{"size":42,"count":119}]
Minimum variable degree0
Maximum variable degree16
Distribution of variable degrees[{"degree":0,"count":372},{"degree":1,"count":135},{"degree":2,"count":83},{"degree":3,"count":11},{"degree":4,"count":12},{"degree":5,"count":49},{"degree":6,"count":23},{"degree":7,"count":15},{"degree":8,"count":15},{"degree":9,"count":23},{"degree":10,"count":22},{"degree":11,"count":24},{"degree":12,"count":19},{"degree":13,"count":6},{"degree":14,"count":6},{"degree":15,"count":2},{"degree":16,"count":1}]
Minimum constraint arity1
Maximum constraint arity12
Distribution of constraint arities[{"arity":1,"count":155},{"arity":2,"count":174},{"arity":3,"count":57},{"arity":4,"count":13},{"arity":5,"count":22},{"arity":6,"count":21},{"arity":7,"count":20},{"arity":8,"count":19},{"arity":9,"count":19},{"arity":10,"count":17},{"arity":11,"count":14},{"arity":12,"count":14}]
Number of extensional constraints100
Number of intensional constraints427
Distribution of constraint types[{"type":"extension","count":100},{"type":"intension","count":427},{"type":"count","count":18}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297561SAT (TO)150 19949.1 2520.1
OscaR - Parallel with EPS 2018-08-14 (complete)4308917SAT (TO)190 20010 2520.34
OscaR - Parallel with EPS 2018-07-02 (complete)4291148Wrong UNSAT 4.24117 1.82823

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: 150
Solution found:
<instantiation> <list>c[0][0] c[0][1] c[0][2] c[0][3] c[0][4] c[0][5] c[0][6] c[0][7] c[0][8] c[0][9] c[1][0] c[1][1] c[1][2] c[1][3]
c[1][4] c[1][5] c[1][6] c[1][7] c[1][8] c[1][9] c[2][0] c[2][1] c[2][2] c[2][3] c[2][4] c[2][5] c[2][6] c[2][7] c[2][8] c[2][9] c[3][0]
c[3][1] c[3][2] c[3][3] c[3][4] c[3][5] c[3][6] c[3][7] c[3][8] c[3][9] c[4][0] c[4][1] c[4][2] c[4][3] c[4][4] c[4][5] c[4][6] c[4][7]
c[4][8] c[4][9] c[5][0] c[5][1] c[5][2] c[5][3] c[5][4] c[5][5] c[5][6] c[5][7] c[5][8] c[5][9] c[6][0] c[6][1] c[6][2] c[6][3] c[6][4]
c[6][5] c[6][6] c[6][7] c[6][8] c[6][9] c[7][0] c[7][1] c[7][2] c[7][3] c[7][4] c[7][5] c[7][6] c[7][7] c[7][8] c[7][9] c[8][0] c[8][1]
c[8][2] c[8][3] c[8][4] c[8][5] c[8][6] c[8][7] c[8][8] c[8][9] c[9][0] c[9][1] c[9][2] c[9][3] c[9][4] c[9][5] c[9][6] c[9][7] c[9][8]
c[9][9] c[10][0] c[10][1] c[10][2] c[10][3] c[10][4] c[10][5] c[10][6] c[10][7] c[10][8] c[10][9] c[11][0] c[11][1] c[11][2] c[11][3]
c[11][4] c[11][5] c[11][6] c[11][7] c[11][8] c[11][9] c[12][0] c[12][1] c[12][2] c[12][3] c[12][4] c[12][5] c[12][6] c[12][7] c[12][8]
c[12][9] c[13][0] c[13][1] c[13][2] c[13][3] c[13][4] c[13][5] c[13][6] c[13][7] c[13][8] c[13][9] c[14][0] c[14][1] c[14][2] c[14][3]
c[14][4] c[14][5] c[14][6] c[14][7] c[14][8] c[14][9] c[15][0] c[15][1] c[15][2] c[15][3] c[15][4] c[15][5] c[15][6] c[15][7] c[15][8]
c[15][9] c[16][0] c[16][1] c[16][2] c[16][3] c[16][4] c[16][5] c[16][6] c[16][7] c[16][8] c[16][9] c[17][0] c[17][1] c[17][2] c[17][3]
c[17][4] c[17][5] c[17][6] c[17][7] c[17][8] c[17][9] c[18][0] c[18][1] c[18][2] c[18][3] c[18][4] c[18][5] c[18][6] c[18][7] c[18][8]
c[18][9] c[19][0] c[19][1] c[19][2] c[19][3] c[19][4] c[19][5] c[19][6] c[19][7] c[19][8] c[19][9] l[0][0] l[0][1] l[0][2] l[0][3] l[0][4]
l[0][5] l[0][6] l[0][7] l[0][8] l[0][9] l[1][0] l[1][1] l[1][2] l[1][3] l[1][4] l[1][5] l[1][6] l[1][7] l[1][8] l[1][9] l[2][0] l[2][1]
l[2][2] l[2][3] l[2][4] l[2][5] l[2][6] l[2][7] l[2][8] l[2][9] l[3][0] l[3][1] l[3][2] l[3][3] l[3][4] l[3][5] l[3][6] l[3][7] l[3][8]
l[4][0] l[4][1] l[4][2] l[4][3] l[4][4] l[4][5] l[4][6] l[4][7] l[4][8] l[5][0] l[5][1] l[5][2] l[5][3] l[5][4] l[5][5] l[5][6] l[5][7]
l[6][0] l[6][1] l[6][2] l[6][3] l[6][4] l[6][5] l[6][6] l[6][7] l[7][0] l[7][1] l[7][2] l[7][3] l[7][4] l[7][5] l[7][6] l[8][0] l[8][1]
l[8][2] l[8][3] l[8][4] l[8][5] l[8][6] l[9][0] l[9][1] l[9][2] l[9][3] l[9][4] l[9][5] l[10][0] l[10][1] l[10][2] l[10][3] l[10][4]
l[10][5] l[11][0] l[11][1] l[11][2] l[11][3] l[11][4] l[12][0] l[12][1] l[12][2] l[12][3] l[12][4] l[13][0] l[13][1] l[13][2] l[13][3]
l[14][0] l[14][1] l[14][2] l[14][3] l[15][0] l[15][1] l[15][2] l[16][0] l[16][1] l[16][2] l[17][0] l[17][1] l[18][0] l[18][1] l[19][0]
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[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[5][0] a[5][1] a[5][2] a[5][3] a[5][4] a[5][5] a[5][6] a[5][7] a[7][0] a[7][1] a[7][2] a[7][3] a[7][4] a[7][5] a[7][6]
a[9][0] a[9][1] a[9][2] a[9][3] a[9][4] a[9][5] a[11][0] a[11][1] a[11][2] a[11][3] a[11][4] a[13][0] a[13][1] a[13][2] a[13][3] a[15][0]
a[15][1] a[15][2] a[17][0] a[17][1] a[19][0] i[2][0] i[2][1] i[2][2] i[2][3] i[2][4] i[2][5] i[2][6] i[2][7] i[2][8] i[2][9] i[4][0] i[4][1]
i[4][2] i[4][3] i[4][4] i[4][5] i[4][6] i[4][7] i[4][8] i[6][0] i[6][1] i[6][2] i[6][3] i[6][4] i[6][5] i[6][6] i[6][7] i[8][0] i[8][1]
i[8][2] i[8][3] i[8][4] i[8][5] i[8][6] i[10][0] i[10][1] i[10][2] i[10][3] i[10][4] i[10][5] i[12][0] i[12][1] i[12][2] i[12][3] i[12][4]
i[14][0] i[14][1] i[14][2] i[14][3] i[16][0] i[16][1] i[16][2] i[18][0] i[18][1] cnt[0] cnt[1] cnt[2] cnt[3] cnt[4] cnt[5] cnt[6] cnt[7]
cnt[8] cnt[9] cnt[10] cnt[11] cnt[12] cnt[13] cnt[14] cnt[15] cnt[16] cnt[17] </list> <values>0 0 0 0 0 0 0 0 0 0 16 0 0 16 16 0 0 2 0 8 0 0
0 0 0 0 0 0 0 0 4 0 0 0 4 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 9 13 13 16 10 12 9 15 9 12 7 13 13 4 7 0 9 1 0 3 7 13 13 4 7
9 1 3 0 0 3 13 13 3 3 7 1 3 0 3 13 13 3 3 7 1 3 0 3 13 2 0 0 7 5 3 3 13 2 7 5 3 0 0 3 13 3 4 5 3 0 3 13 3 4 5 3 0 3 13 3 3 0 3 3 13 3 3 3 0
3 13 3 3 3 3 13 3 3 3 3 2 0 0 3 2 0 0 3 3 0 3 3 0 3 3 3 3 6 1 1 1 1 2 0 1 2 0 1 1 1 1 1 1 1 1 1 0 1 1 3 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 2 0 1
1 1 1 1 1 1 4 0 0 1 1 0 1 1 2 0 1 2 3 4 6 7 9 9 9 0 1 2 3 4 5 6 7 8 0 1 2 5 6 7 7 7 0 1 2 3 4 5 6 0 1 2 3 5 5 0 1 2 3 4 0 1 3 3 0 1 2 0 1 2
2 1 1 2 2 1 1 1 1 0 0 2 2 1 1 0 0 </values> </instantiation>