Name | csp/travellingSalesman-25/ normalized-tsp-25-523_ext.xml |
MD5SUM | a3c9be0c891d85f7c4694b452ebfd1e1 |
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 | 3.19851 |
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:15 17 13 10 18 3 14 0 3 0 16 6 17 4 19 4 20 1 6 0 22 15 23 2 25 4 24 24 5 1 4 2 9 7 12 15 10 11 8 11 11 1 2 0 7 17 21 12 1 8 27 30 30 30 36 40 44 45 45 60 62 66 90 91 93 100 115 126 137 138 138 155 167 175 175 0