| Name | Renault/Renault-m1-s1/ Renault-souffleuse.xml |
| MD5SUM | df23e3c33d5f18cffd66f727a476ed8f |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.0054429998 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 32 |
| Number of constraints | 35 |
| Number of domains | 9 |
| Minimum domain size | 2 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":2,"count":5},{"size":3,"count":6},{"size":4,"count":8},{"size":5,"count":6},{"size":6,"count":2},{"size":7,"count":2},{"size":8,"count":1},{"size":9,"count":1},{"size":12,"count":1}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":1,"count":8},{"degree":2,"count":14},{"degree":3,"count":7},{"degree":5,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":2,"count":33},{"arity":3,"count":2}] |
| Number of extensional constraints | 35 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":35}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251909 | SAT | 0.004032 | 0.00593212 |
| miniBTD 2017-08-10 (complete) | 4264997 | SAT | 0.0041510002 | 0.0043979702 |
| Naxos 1.1.0 (complete) | 4251911 | SAT | 0.004425 | 0.00643794 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251910 | SAT | 0.004938 | 0.00705504 |
| cosoco-mini 1.12 (complete) | 4267438 | SAT | 0.0054429998 | 0.0060840701 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260257 | SAT | 0.005599 | 0.090233102 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x1 x3 x7 x0[0] x0[1] x0[2] x0[3] x0[4] x0[5] x2[0] x2[1] x2[2] x2[3] x2[4] x2[5] x4[0] x4[1] x5[0] x5[1] x5[2] x5[3] x5[4] x6[0] x6[1] x6[2] x6[3] x6[4] x6[5] x6[6] x6[7] x8[0] x8[1] </list> <values> 4 0 0 0 0 0 0 0 0 1 2 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>