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

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

Jump to solvers results

General information on the benchmark

NameTal/
Tal-02_c18.xml
MD5SUM66ad3cf55c90c9564165fed11cad25f4
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark86
Best CPU time to get the best result obtained on this benchmark3.30776
Satisfiable
(Un)Satisfiability was proved
Number of variables298
Number of constraints217
Number of domains9
Minimum domain size1
Maximum domain size42
Distribution of domain sizes[{"size":1,"count":45},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":35},{"size":10,"count":21},{"size":42,"count":47}]
Minimum variable degree0
Maximum variable degree12
Distribution of variable degrees[{"degree":0,"count":128},{"degree":1,"count":45},{"degree":2,"count":37},{"degree":3,"count":7},{"degree":4,"count":8},{"degree":5,"count":19},{"degree":6,"count":15},{"degree":7,"count":11},{"degree":8,"count":11},{"degree":9,"count":8},{"degree":10,"count":5},{"degree":11,"count":3},{"degree":12,"count":1}]
Minimum constraint arity1
Maximum constraint arity9
Distribution of constraint arities[{"arity":1,"count":69},{"arity":2,"count":68},{"arity":3,"count":23},{"arity":4,"count":9},{"arity":5,"count":14},{"arity":6,"count":13},{"arity":7,"count":11},{"arity":8,"count":8},{"arity":9,"count":2}]
Number of extensional constraints36
Number of intensional constraints171
Distribution of constraint types[{"type":"extension","count":36},{"type":"intension","count":171},{"type":"count","count":10}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4293055OPT86 3.30776 3.30875
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311712OPT86 3.97445 1.76872
OscaR - Hybrid 2018-08-14 (complete)4308562OPT86 4.44374 1.91562
Choco-solver 4.0.7b seq (e747e1e) (complete)4306682OPT86 7.48326 3.3671
PicatSAT 2018-06-15 (complete)4293056OPT86 20.0713 20.0892
PicatSAT 2018-08-02 (complete)4303158OPT86 21.1844 21.1868
Concrete 3.8 2018-06-13 (complete)4293053OPT86 21.3858 9.29575
Concrete 3.8-SuperNG 2018-06-13 (complete)4293054OPT86 21.5053 8.63901
Concrete 3.9.2-SuperNG (complete)4304216OPT86 22.1208 8.17943
PicatSAT 2018-08-14 (complete)4309498OPT86 22.7036 22.7053
Concrete 3.9.2 (complete)4304215OPT86 23.3683 11.3168
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307976SAT (TO)86 2520.07 2486.81
Mistral-2.0 2018-06-15 (complete)4289312? (MO) 18.3452 18.3474
Mistral-2.0 2018-08-01 (complete)4303744? (NS) 0.021378 0.0220409
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290432? (TO) 2400.09 2369.91
Sat4j-CSP 2018-07-11 (complete)4289945? (TO) 2400.23 2381.03
Choco-solver 4.0.7 seq (493a269) (complete)4292388Wrong UNSAT 2.30386 0.891165
OscaR - Hybrid 2018-07-02 (complete)4291630Wrong UNSAT 3.36023 1.56161

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: 86
Solution found:
<instantiation type='solution' cost='86'> <list>a[0][0] a[0][1] a[0][2] a[0][3] a[0][4] a[0][5] a[10][0] a[10][1] a[10][2] a[10][3] a[10][4]
a[10][5] a[11][0] a[11][1] a[11][2] a[11][3] a[11][4] a[11][5] a[1][0] a[1][1] a[1][2] a[1][3] a[1][4] a[1][5] a[2][0] a[2][1] a[2][2]
a[2][3] a[2][4] a[2][5] a[3][0] a[3][1] a[3][2] a[3][3] a[3][4] a[3][5] a[4][0] a[4][1] a[4][2] a[4][3] a[4][4] a[4][5] a[5][0] a[5][1]
a[5][2] a[5][3] a[5][4] a[5][5] a[6][0] a[6][1] a[6][2] a[6][3] a[6][4] a[6][5] a[7][0] a[7][1] a[7][2] a[7][3] a[7][4] a[7][5] a[8][0]
a[8][1] a[8][2] a[8][3] a[8][4] a[8][5] a[9][0] a[9][1] a[9][2] a[9][3] a[9][4] a[9][5] c[0][0] c[0][1] c[0][2] c[0][3] c[0][4] c[0][5]
c[10][0] c[10][1] c[10][2] c[10][3] c[10][4] c[10][5] c[11][0] c[11][1] c[11][2] c[11][3] c[11][4] c[11][5] c[1][0] c[1][1] c[1][2] c[1][3]
c[1][4] c[1][5] c[2][0] c[2][1] c[2][2] c[2][3] c[2][4] c[2][5] c[3][0] c[3][1] c[3][2] c[3][3] c[3][4] c[3][5] c[4][0] c[4][1] c[4][2]
c[4][3] c[4][4] c[4][5] c[5][0] c[5][1] c[5][2] c[5][3] c[5][4] c[5][5] c[6][0] c[6][1] c[6][2] c[6][3] c[6][4] c[6][5] c[7][0] c[7][1]
c[7][2] c[7][3] c[7][4] c[7][5] c[8][0] c[8][1] c[8][2] c[8][3] c[8][4] c[8][5] c[9][0] c[9][1] c[9][2] c[9][3] c[9][4] c[9][5] cnt[0]
cnt[1] cnt[2] cnt[3] cnt[4] cnt[5] cnt[6] cnt[7] cnt[8] cnt[9] i[0][0] i[0][1] i[0][2] i[0][3] i[0][4] i[0][5] i[10][0] i[10][1] i[10][2]
i[10][3] i[10][4] i[10][5] i[11][0] i[11][1] i[11][2] i[11][3] i[11][4] i[11][5] i[1][0] i[1][1] i[1][2] i[1][3] i[1][4] i[1][5] i[2][0]
i[2][1] i[2][2] i[2][3] i[2][4] i[2][5] i[3][0] i[3][1] i[3][2] i[3][3] i[3][4] i[3][5] i[4][0] i[4][1] i[4][2] i[4][3] i[4][4] i[4][5]
i[5][0] i[5][1] i[5][2] i[5][3] i[5][4] i[5][5] i[6][0] i[6][1] i[6][2] i[6][3] i[6][4] i[6][5] i[7][0] i[7][1] i[7][2] i[7][3] i[7][4]
i[7][5] i[8][0] i[8][1] i[8][2] i[8][3] i[8][4] i[8][5] i[9][0] i[9][1] i[9][2] i[9][3] i[9][4] i[9][5] l[0][0] l[0][1] l[0][2] l[0][3]
l[0][4] l[0][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[11][5] l[1][0] l[1][1]
l[1][2] l[1][3] l[1][4] l[1][5] l[2][0] l[2][1] l[2][2] l[2][3] l[2][4] l[2][5] l[3][0] l[3][1] l[3][2] l[3][3] l[3][4] l[3][5] l[4][0]
l[4][1] l[4][2] l[4][3] l[4][4] l[4][5] 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[7][5] l[8][0] l[8][1] l[8][2] l[8][3] l[8][4] l[8][5] l[9][0] l[9][1] l[9][2] l[9][3] l[9][4]
l[9][5] </list> <values>* * * * * * * * * * * * 1 * * * * * 1 1 2 0 1 1 * * * * * * 1 1 1 2 0 * * * * * * * 1 2 0 1 * * * * * * * * 1 2 0 *
* * * * * * * * 2 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 16 0 16 0 0 0 0 0 0 0 0 0 16 0 4 0 0 0 0 0 0 0 0
0 16 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 * * * * * * 0 1 * * * * * * * * * * * * * * * * 0 1 2 4 5 5 * * * * * * 0 1 2 3 4 *
* * * * * * 0 1 3 3 * * * * * * * * 0 1 2 * * * * * * * * * 15 11 13 9 10 12 6 0 * * * * 6 * * * * * 15 7 2 0 10 12 15 7 2 10 12 0 15 4 3 7
0 * 15 4 3 7 0 * 15 4 0 3 * * 15 4 3 0 * * 15 4 0 * * * 15 4 0 * * * 6 0 * * * * </values> </instantiation>