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

Result page for benchmark
Mario/Mario-zinc-s1/
Mario-n-medium-2.xml

Jump to solvers results

General information on the benchmark

NameMario/Mario-zinc-s1/
Mario-n-medium-2.xml
MD5SUMd930a285b222420c6879960cff9efc87
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark1053
Best CPU time to get the best result obtained on this benchmark198.816
Satisfiable
(Un)Satisfiability was proved
Number of variables90
Number of constraints61
Number of domains54
Minimum domain size1
Maximum domain size30
Distribution of domain sizes[{"size":1,"count":2},{"size":2,"count":28},{"size":28,"count":1},{"size":29,"count":5},{"size":30,"count":54}]
Minimum variable degree1
Maximum variable degree3
Distribution of variable degrees[{"degree":1,"count":2},{"degree":2,"count":59},{"degree":3,"count":29}]
Minimum constraint arity1
Maximum constraint arity30
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":58},{"arity":30,"count":2}]
Number of extensional constraints30
Number of intensional constraints29
Distribution of constraint types[{"type":"extension","count":30},{"type":"intension","count":29},{"type":"sum","count":1},{"type":"circuit","count":1}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-09-16 (complete)4400527OPT1053 198.816 50.3626
choco-solver 2019-09-24 (complete)4406527OPT1053 208.192 203.895
choco-solver 2019-06-14 (complete)4394267OPT1053 241.716 75.907
choco-solver 2019-09-16 parallel (complete)4400227OPT1053 344.2 43.8461
choco-solver 2019-09-24 parallel (complete)4407427OPT1053 370.712 47.2125
choco-solver 2019-06-14 parallel (complete)4394567OPT1053 372.598 47.5223
AbsCon 2019-07-23 (complete)4391267OPT1053 452.987 448.415
cosoco 2.0 (complete)4409087OPT1053 552.992 553.008
cosoco 2.0 (complete)4397827OPT1053 556.498 556.452
cosoco 2 (complete)4390367OPT1053 559.623 559.616
Concrete 3.12.3 (complete)4403227OPT1053 827.171 804.999
PicatSAT 2019-09-12 (complete)4395647OPT1053 854.219 854.134
Concrete 3.10 (complete)4392167OPT1053 933.751 899.814
Concrete 3.12.2 (complete)4401427OPT1053 1405.77 1372.89
cosoco 2.O parallel (complete)4398727OPT1053 1865.48 233.591
cosoco 2.0 parallel (complete)4409987SAT (TO)1053 2012.64 252.024
Concrete 3.12.2 (complete)4396547SAT (TO)990 2400.06 2352.04
choco-solver 2019-09-20 (complete)4404127Wrong UNSAT 2.08741 0.818709
choco-solver 2019-09-20 parallel (complete)4405027Wrong UNSAT 3.172 0.959584

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: 1053
Solution found:
<instantiation> <list>s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[20]
s[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] f[0] f[1] f[2] f[3] f[4] f[5] f[6] f[7] f[8] f[9] f[10] f[11] f[12] f[13] f[14] f[15]
f[16] f[17] f[18] f[19] f[20] f[21] f[22] f[23] f[24] f[25] f[26] f[27] f[28] f[29] g[0] g[1] g[2] g[3] g[4] g[5] g[6] g[7] g[8] g[9] g[10]
g[11] g[12] g[13] g[14] g[15] g[16] g[17] g[18] g[19] g[20] g[21] g[22] g[23] g[24] g[25] g[26] g[27] g[28] g[29] </list> <values>10 0 29 19
1 5 6 2 9 25 22 4 20 13 24 15 12 17 18 16 28 21 14 23 7 3 26 11 27 8 34 0 296 83 13 0 0 31 54 54 207 228 122 0 16 0 23 0 0 85 127 0 270 0 68
152 0 45 34 55 0 0 40 67 89 0 0 19 47 68 94 86 34 0 14 0 67 0 0 31 78 0 99 0 56 14 0 35 53 62 </values> </instantiation>