| Name | QRandom/QRandom-composed-s75/ composed-75-01-25-6.xml |
| MD5SUM | 3604f03ade31706fc8f860f14c72a950 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.024673 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 83 |
| Number of constraints | 647 |
| Number of domains | 1 |
| Minimum domain size | 10 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":10,"count":83}] |
| Minimum variable degree | 6 |
| Maximum variable degree | 26 |
| Distribution of variable degrees | [{"degree":6,"count":1},{"degree":8,"count":3},{"degree":9,"count":5},{"degree":10,"count":3},{"degree":11,"count":4},{"degree":13,"count":10},{"degree":14,"count":6},{"degree":15,"count":7},{"degree":16,"count":12},{"degree":17,"count":6},{"degree":18,"count":6},{"degree":19,"count":4},{"degree":20,"count":4},{"degree":21,"count":6},{"degree":22,"count":1},{"degree":23,"count":3},{"degree":25,"count":1},{"degree":26,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":647}] |
| Number of extensional constraints | 647 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":647}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264956 | UNSAT | 0.024673 | 0.0253751 |
| miniBTD 2017-06-30 (complete) | 4252301 | UNSAT | 0.024931 | 0.026109 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260216 | UNSAT | 0.043212999 | 0.0862609 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252302 | UNSAT | 0.043266 | 0.045981 |
| cosoco-mini 1.12 (complete) | 4267397 | UNSAT | 0.043937001 | 0.044785898 |
| Naxos 1.1.0 (complete) | 4252303 | ? (TO) | 2400.02 | 2399.8 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: