Name | TravellingSalesman/TravellingSalesman-m1-n20/ TravellingSalesman-20-30-02.xml |
MD5SUM | a68811cefd95bd5595684aa0eec29a9f |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 119 |
Best CPU time to get the best result obtained on this benchmark | 2400.02 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 40 |
Number of constraints | 21 |
Number of domains | 2 |
Minimum domain size | 20 |
Maximum domain size | 32 |
Distribution of domain sizes | [{"size":20,"count":20},{"size":32,"count":20}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":20},{"degree":3,"count":20}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 20 |
Distribution of constraint arities | [{"arity":3,"count":20},{"arity":20,"count":1}] |
Number of extensional constraints | 20 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":20},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Naxos 1.1.0 (complete) | 4253437 | SAT (TO) | 119 | 2400.02 | 2402 |
cosoco-mini 1.12 (complete) | 4267202 | SAT (TO) | 119 | 2400.03 | 2399.8 |
cosoco-mini 1.1 (2017-07-29) (complete) | 4260021 | SAT (TO) | 119 | 2400.0601 | 2400.21 |
cosoco-mini 1.1 (2017-06-27) (complete) | 4253436 | ? (TO) | 2400.08 | 2400 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 119<instantiation> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] </list> <values> 0 1 6 8 4 2 7 9 11 13 15 18 16 17 19 14 12 10 5 3 3 10 4 6 10 6 4 6 5 7 12 4 8 3 8 3 6 5 4 5 </values> </instantiation>