| Name | NumberPartitioning/NumberPartitioning-m1-s1/ NumberPartitioning-064.xml |
| MD5SUM | 019f4b77ddc0f15b2fea5bd490d99eee |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 5.1842 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 128 |
| Number of constraints | 72 |
| Number of domains | 2 |
| Minimum domain size | 64 |
| Maximum domain size | 4096 |
| Distribution of domain sizes | [{"size":64,"count":64},{"size":4096,"count":64}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":64},{"degree":4,"count":63},{"degree":5,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":64},{"arity":32,"count":6},{"arity":64,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 65 |
| Distribution of constraint types | [{"type":"intension","count":65},{"type":"allDifferent","count":1},{"type":"ordered","count":2},{"type":"sum","count":4}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation id='sol1' type='solution'> <list> x[] y[] cx[] cy[] </list> <values> 1 2 3 4 5 6 7 8 9 31 32 33 34 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 54 63 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 35 53 55 56 57 58 59 60 61 62 64 1 4 9 16 25 36 49 64 81 961 1024 1089 1156 1296 1369 1444 1521 1600 1681 1764 1849 1936 2025 2116 2209 2304 2401 2500 2601 2704 2916 3969 100 121 144 169 196 225 256 289 324 361 400 441 484 529 576 625 676 729 784 841 900 1225 2809 3025 3136 3249 3364 3481 3600 3721 3844 4096 </values> </instantiation>