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-5-20-1.xml

Jump to solvers results

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-5-20-1.xml
MD5SUM3ec6160036052286f30104bba84c59a2
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark102
Best CPU time to get the best result obtained on this benchmark0.55339
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints652
Number of domains52
Minimum domain size2
Maximum domain size30
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":6},{"size":4,"count":14},{"size":5,"count":9},{"size":13,"count":3},{"size":14,"count":3},{"size":15,"count":4},{"size":16,"count":2},{"size":17,"count":5},{"size":18,"count":2},{"size":19,"count":1},{"size":29,"count":20},{"size":30,"count":30}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":50},{"degree":22,"count":29},{"degree":23,"count":1},{"degree":31,"count":20}]
Minimum constraint arity1
Maximum constraint arity30
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":650},{"arity":30,"count":1}]
Number of extensional constraints50
Number of intensional constraints601
Distribution of constraint types[{"type":"extension","count":50},{"type":"intension","count":601},{"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)4397013OPT102 0.55339 0.553639
cosoco 2.0 (complete)4408273OPT102 0.559911 0.564214
cosoco 2 (complete)4389733OPT102 0.63624 0.64065
choco-solver 2019-09-24 (complete)4406093OPT102 3.64049 1.34783
cosoco 2.O parallel (complete)4398293OPT102 4.50009 0.814697
cosoco 2.0 parallel (complete)4409553OPT102 4.54454 0.821712
choco-solver 2019-06-14 (complete)4393233OPT102 9.11098 2.9475
AbsCon 2019-07-23 (complete)4390833OPT102 9.1154 3.98903
choco-solver 2019-09-16 (complete)4399193OPT102 9.18788 2.91316
Concrete 3.12.3 (complete)4402793OPT102 12.9581 5.99147
Concrete 3.12.2 (complete)4400993OPT102 13.5436 5.52656
choco-solver 2019-09-16 parallel (complete)4399793OPT102 14.2415 3.2477
choco-solver 2019-09-24 parallel (complete)4406993OPT102 15.9423 3.68808
Concrete 3.12.2 (complete)4396113OPT102 21.0569 10.1965
PicatSAT 2019-09-12 (complete)4395213OPT102 46.2091 46.2153
choco-solver 2019-06-14 parallel (complete)4393833Wrong Opt.133 11.9488 3.08395
Concrete 3.10 (complete)4387170Wrong Opt.175 28.1064 16.1445
choco-solver 2019-09-20 (complete)4403693Wrong Opt.293 8.10524 2.61401
choco-solver 2019-09-20 parallel (complete)4404593Wrong Opt.293 11.8588 3.01063

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