Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-wil100.xml |
MD5SUM | 1336f815b0da41bdd00c29c220879b91 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 148097 |
Best CPU time to get the best result obtained on this benchmark | 2400.05 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 10100 |
Number of constraints | 4951 |
Number of domains | 2 |
Minimum domain size | 10 |
Maximum domain size | 100 |
Distribution of domain sizes | [{"size":10,"count":4950},{"size":100,"count":100}] |
Minimum variable degree | 0 |
Maximum variable degree | 100 |
Distribution of variable degrees | [{"degree":0,"count":5050},{"degree":2,"count":4950},{"degree":100,"count":100}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 100 |
Distribution of constraint arities | [{"arity":3,"count":4950},{"arity":100,"count":1}] |
Number of extensional constraints | 4950 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":4950},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 2 (complete) | 4394685 | SAT (TO) | 148097 | 2400.05 | 2400.21 |
cosoco 2.0 (complete) | 4408830 | SAT (TO) | 148097 | 2400.1 | 2400.12 |
cosoco 2.0 (complete) | 4397570 | SAT (TO) | 148097 | 2400.1 | 2400.21 |
(reference) PicatSAT 2019-09-12 (complete) | 4407569 | ? (TO) | 2400.13 | 2400.34 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 148097--too large--