Name | csp/travellingSalesman-25/ normalized-tsp-25-312_ext.xml |
MD5SUM | 65f85b567c2a964c1b318550507e81c9 |
Bench Category | N-ARY-EXT (n-ary constraints in extension) |
Best result obtained on this benchmark | SAT |
Best CPU time to get the best result obtained on this benchmark | 28.6646 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 76 |
Number of constraints | 350 |
Maximum constraint arity | 3 |
Maximum domain size | 1001 |
Number of constraints which are defined in extension | 350 |
Number of constraints which are defined in intension | 0 |
Global constraints used (with number of constraints) |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
Solution found:24 1 18 1 15 20 17 1 25 13 23 7 2 4 16 17 1 15 13 6 5 14 11 5 7 0 4 10 14 4 20 1 10 3 8 8 6 1 9 17 19 9 12 9 22 1 3 13 21 9 2 22 23 36 43 47 64 79 85 99 104 104 114 118 119 122 130 131 148 157 166 167 180 189 189 0