2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Tpp/Tpp-zinc-s1/
Tpp-7-5-30-1.xml

Jump to solvers results

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-7-5-30-1.xml
MD5SUM74f6b053d0485b3d7d553e00e4caa41f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark124
Best CPU time to get the best result obtained on this benchmark2.0694
Satisfiable
(Un)Satisfiability was proved
Number of variables130
Number of constraints1117
Number of domains67
Minimum domain size2
Maximum domain size35
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":6},{"size":4,"count":18},{"size":5,"count":10},{"size":14,"count":2},{"size":15,"count":2},{"size":16,"count":7},{"size":17,"count":12},{"size":18,"count":6},{"size":19,"count":1},{"size":34,"count":30},{"size":35,"count":35}]
Minimum variable degree2
Maximum variable degree36
Distribution of variable degrees[{"degree":2,"count":65},{"degree":32,"count":34},{"degree":33,"count":1},{"degree":36,"count":30}]
Minimum constraint arity1
Maximum constraint arity35
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":1115},{"arity":35,"count":1}]
Number of extensional constraints65
Number of intensional constraints1051
Distribution of constraint types[{"type":"extension","count":65},{"type":"intension","count":1051},{"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 (complete)4390285OPT124 2.0694 2.07004
cosoco 2.0 (complete)4409005OPT124 2.07135 2.07174
cosoco 2.0 (complete)4397745OPT124 2.08108 2.08184
choco-solver 2019-09-24 (complete)4406445OPT124 5.44595 2.14676
AbsCon 2019-07-23 (complete)4391185OPT124 8.57846 4.2797
cosoco 2.0 parallel (complete)4409905OPT124 14.0396 2.20777
choco-solver 2019-09-16 (complete)4400445OPT124 15.106 4.83643
cosoco 2.O parallel (complete)4398645OPT124 15.6869 2.41744
Concrete 3.12.3 (complete)4403145OPT124 18.2673 8.59459
Concrete 3.12.2 (complete)4401345OPT124 20.5783 9.06095
choco-solver 2019-06-14 (complete)4394185OPT124 20.6129 6.43094
Concrete 3.12.2 (complete)4396465OPT124 24.9217 12.7158
choco-solver 2019-09-16 parallel (complete)4400145OPT124 28.4832 6.04588
choco-solver 2019-09-24 parallel (complete)4407345OPT124 30.6929 6.80327
choco-solver 2019-06-14 parallel (complete)4394485OPT124 42.2556 8.11734
PicatSAT 2019-09-12 (complete)4395565OPT124 47.2427 47.2499
Concrete 3.10 (complete)4392085Wrong Opt.205 57.8082 42.5762
choco-solver 2019-09-20 (complete)4404045Wrong UNSAT 6.90565 2.74432
choco-solver 2019-09-20 parallel (complete)4404945Wrong UNSAT 19.5234 4.81732

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: 124
Solution found:
<instantiation type='solution' cost='124'> <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[20] c[21] c[22]
c[23] c[24] c[25] c[26] c[27] c[28] c[29] 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[18]
d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[2] d[30] d[31] d[32] d[33] d[34] 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[20] l[21] l[22] l[23] l[24] l[25] l[26] l[27] l[28] l[29] 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[18] s[19] s[1] s[20] s[21] s[22] s[23] s[24] s[25]
s[26] s[27] s[28] s[29] s[2] s[30] s[31] s[32] s[33] s[34] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>4 1 2 2 2 1 3 2 2 3 1 1 3 4 2
1 1 1 4 2 1 4 8 1 2 3 1 2 1 4 0 0 0 0 0 0 0 0 5 4 9 0 0 0 0 0 2 0 1 2 0 0 0 0 5 8 12 7 0 0 0 0 0 0 0 26 32 32 27 26 18 24 24 18 26 33 31 24
18 17 32 19 17 27 27 33 18 33 19 18 24 31 24 24 31 0 10 11 12 13 14 15 16 18 19 26 1 20 21 22 23 17 25 27 34 28 29 2 30 24 31 32 33 3 4 5 6
7 8 9 </values> </instantiation>