2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Tpp/Tpp-zinc-s1/
Tpp-6-3-20-1.xml

Jump to solvers results

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-3-20-1.xml
MD5SUMb4cf0cb08a05c1b083ee2f2000733b36
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark131
Best CPU time to get the best result obtained on this benchmark0.191809
Satisfiable
(Un)Satisfiability was proved
Number of variables76
Number of constraints400
Number of domains40
Minimum domain size3
Maximum domain size18
Distribution of domain sizes[{"size":3,"count":6},{"size":4,"count":9},{"size":5,"count":3},{"size":8,"count":1},{"size":10,"count":2},{"size":11,"count":4},{"size":12,"count":6},{"size":13,"count":5},{"size":14,"count":1},{"size":15,"count":1},{"size":17,"count":20},{"size":18,"count":18}]
Minimum variable degree2
Maximum variable degree23
Distribution of variable degrees[{"degree":2,"count":38},{"degree":19,"count":20},{"degree":22,"count":17},{"degree":23,"count":1}]
Minimum constraint arity1
Maximum constraint arity18
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":398},{"arity":18,"count":1}]
Number of extensional constraints38
Number of intensional constraints361
Distribution of constraint types[{"type":"extension","count":38},{"type":"intension","count":361},{"type":"circuit","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.0 (complete)4397085OPT131 0.191809 0.191808
cosoco 2.0 (complete)4408345OPT131 0.193466 0.193469
cosoco 2 (complete)4389805OPT131 0.218657 0.219055
cosoco 2.0 parallel (complete)4409625OPT131 0.54685 0.21906
cosoco 2.O parallel (complete)4398365OPT131 0.581461 0.21922
choco-solver 2019-09-24 (complete)4406165OPT131 2.71321 1.31565
AbsCon 2019-07-23 (complete)4390905OPT131 5.1595 2.73296
choco-solver 2019-09-16 (complete)4399265OPT131 5.81773 1.9087
choco-solver 2019-06-14 (complete)4393305OPT131 5.84736 1.91135
choco-solver 2019-09-16 parallel (complete)4399865OPT131 8.05951 2.1303
choco-solver 2019-09-24 parallel (complete)4407065OPT131 9.02823 2.17643
choco-solver 2019-06-14 parallel (complete)4393905OPT131 9.46222 2.26769
Concrete 3.12.3 (complete)4402865OPT131 9.71783 4.10421
Concrete 3.12.2 (complete)4401065OPT131 10.6871 4.3402
Concrete 3.12.2 (complete)4396185OPT131 11.9704 4.63981
PicatSAT 2019-09-12 (complete)4395285OPT131 22.9321 22.9381
Concrete 3.10 (complete)4387167Wrong Opt.180 10.1807 4.33718
choco-solver 2019-09-20 (complete)4403765Wrong Opt.223 4.4954 1.5425
choco-solver 2019-09-20 parallel (complete)4404665Wrong Opt.223 6.73956 1.78148

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: 131
Solution found:
<instantiation type='solution' cost='131'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[2] c[3] c[4] c[5]
c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12]
l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17]
s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>7 3 3 6 3 6 8 2 1 1 8 5 2 3 5 2 2 14 7 2 0 4 1 0 0 0 1 13 16 0 0 0 0 0 0 0 0 6
9 15 15 11 9 15 9 11 15 10 16 10 10 10 9 16 9 11 10 11 0 11 17 12 13 14 9 15 16 1 2 3 4 5 6 7 8 10 </values> </instantiation>