2018 XCSP3 competition: fast COP track: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameTal/
Tal-04_c18.xml
MD5SUMf4bb57fd900a6a9a68798497b08fcf01
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark142
Best CPU time to get the best result obtained on this benchmark252.034
Satisfiable
(Un)Satisfiability was proved
Number of variables526
Number of constraints362
Number of domains10
Minimum domain size1
Maximum domain size42
Distribution of domain sizes[{"size":1,"count":84},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":52},{"size":7,"count":9},{"size":8,"count":46},{"size":42,"count":79}]
Minimum variable degree0
Maximum variable degree14
Distribution of variable degrees[{"degree":0,"count":234},{"degree":1,"count":84},{"degree":2,"count":58},{"degree":3,"count":9},{"degree":4,"count":10},{"degree":5,"count":32},{"degree":6,"count":19},{"degree":7,"count":13},{"degree":8,"count":13},{"degree":9,"count":22},{"degree":10,"count":17},{"degree":11,"count":6},{"degree":12,"count":6},{"degree":13,"count":2},{"degree":14,"count":1}]
Minimum constraint arity1
Maximum constraint arity10
Distribution of constraint arities[{"arity":1,"count":107},{"arity":2,"count":115},{"arity":3,"count":38},{"arity":4,"count":11},{"arity":5,"count":18},{"arity":6,"count":17},{"arity":7,"count":17},{"arity":8,"count":15},{"arity":9,"count":12},{"arity":10,"count":12}]
Number of extensional constraints64
Number of intensional constraints284
Distribution of constraint types[{"type":"extension","count":64},{"type":"intension","count":284},{"type":"count","count":14}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310086SAT (TO)142 252.034 246.016
Choco-solver 4.0.7b seq (e747e1e) (complete)4301309SAT (TO)142 252.058 244.218
Concrete 3.9.2-SuperNG (complete)4302810SAT (TO)142 252.06 232.75
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312296SAT (TO)142 252.062 246.916
cosoco 1.12 (complete)4301311SAT (TO)146 251.981 252.01
OscaR - Hybrid 2018-08-14 (complete)4310436SAT (TO)146 252.104 241.329
Concrete 3.9.2 (complete)4302460SAT (TO)146 252.146 233.844
Mistral-2.0 2018-08-01 (complete)4312473? (MO) 19.9728 19.9985
Sat4j-CSP 2018-07-11 (complete)4301310? (TO) 252.141 238.444

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