Name | Wwtpp/Wwtpp-ord-s1/ Wwtpp-ord-ex05480.xml |
MD5SUM | c9499957e3a18a7800afc05acf28f8ff |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 476 |
Number of constraints | 402 |
Number of domains | 22 |
Minimum domain size | 1 |
Maximum domain size | 10001 |
Distribution of domain sizes | [{"size":1,"count":22},{"size":2,"count":92},{"size":1001,"count":46},{"size":1501,"count":46},{"size":2501,"count":46},{"size":3001,"count":46},{"size":5001,"count":88},{"size":10001,"count":90}] |
Minimum variable degree | 1 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":1,"count":16},{"degree":2,"count":29},{"degree":3,"count":431}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 24 |
Distribution of constraint arities | [{"arity":2,"count":189},{"arity":3,"count":96},{"arity":4,"count":90},{"arity":10,"count":4},{"arity":11,"count":7},{"arity":12,"count":7},{"arity":13,"count":5},{"arity":14,"count":2},{"arity":23,"count":1},{"arity":24,"count":1}] |
Number of extensional constraints | 192 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":192},{"type":"sum","count":210}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco-mini 1.1 (2017-06-27) (complete) | 4252846 | ? (TO) | 2400.01 | 2400.21 |
Naxos 1.1.0 (complete) | 4252847 | ? (TO) | 2400.0601 | 2400.21 |
cosoco-mini 1.1 (2017-07-29) (complete) | 4260319 | ? (TO) | 2400.0801 | 2400.1001 |
miniBTD 2017-06-30 (complete) | 4252845 | ? (TO) | 2400.0901 | 2400.0801 |
miniBTD 2017-08-10 (complete) | 4265059 | ? (TO) | 2400.0901 | 2400.02 |
cosoco-mini 1.12 (complete) | 4267500 | ? (TO) | 2400.1001 | 2400.1101 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: