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

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

Jump to solvers results

General information on the benchmark

NameTal/
Tal-01_c18.xml
MD5SUMbe8acda3d02cf8f075ea348930aabd56
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark6
Best CPU time to get the best result obtained on this benchmark3.58586
Satisfiable
(Un)Satisfiability was proved
Number of variables76
Number of constraints64
Number of domains6
Minimum domain size1
Maximum domain size42
Distribution of domain sizes[{"size":1,"count":9},{"size":2,"count":4},{"size":3,"count":5},{"size":6,"count":9},{"size":10,"count":6},{"size":42,"count":14}]
Minimum variable degree0
Maximum variable degree9
Distribution of variable degrees[{"degree":0,"count":29},{"degree":1,"count":9},{"degree":2,"count":13},{"degree":3,"count":4},{"degree":4,"count":5},{"degree":5,"count":7},{"degree":6,"count":5},{"degree":7,"count":2},{"degree":8,"count":1},{"degree":9,"count":1}]
Minimum constraint arity1
Maximum constraint arity6
Distribution of constraint arities[{"arity":1,"count":24},{"arity":2,"count":20},{"arity":3,"count":8},{"arity":4,"count":5},{"arity":5,"count":5},{"arity":6,"count":2}]
Number of extensional constraints9
Number of intensional constraints51
Distribution of constraint types[{"type":"extension","count":9},{"type":"intension","count":51},{"type":"count","count":4}]
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)4297555OPT6 3.58586 1.19871
OscaR - Parallel with EPS 2018-07-02 (complete)4291142OPT6 4.20513 1.95893
OscaR - Parallel with EPS 2018-08-14 (complete)4308911OPT6 4.8027 1.97969

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: 6
Solution found:
<instantiation> <list>c[0][0] c[0][1] c[0][2] c[1][0] c[1][1] c[1][2] c[2][0] c[2][1] c[2][2] c[3][0] c[3][1] c[3][2] c[4][0] c[4][1]
c[4][2] c[5][0] c[5][1] c[5][2] l[0][0] l[0][1] l[0][2] l[1][0] l[1][1] l[1][2] l[2][0] l[2][1] l[2][2] l[3][0] l[3][1] l[4][0] l[4][1]
l[5][0] a[1][0] a[1][1] a[1][2] a[3][0] a[3][1] a[5][0] i[2][0] i[2][1] i[2][2] i[4][0] i[4][1] cnt[0] cnt[1] cnt[2] cnt[3] </list>
<values>0 0 0 2 0 0 0 0 0 4 0 0 0 0 0 0 0 0 14 13 2 4 4 3 4 4 3 6 0 6 0 6 1 1 1 3 0 1 0 1 2 0 1 0 0 1 1 </values> </instantiation>