| Name | CarSequencing/CarSequencing-m1-jcr/ CarSequencing-16-81.xml |
| MD5SUM | e1683218a1e3c524b21c5eaa634d1705 |
| 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 | 27.9455 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 600 |
| Number of constraints | 737 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":2,"count":500},{"size":26,"count":100}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 52 |
| Distribution of variable degrees | [{"degree":2,"count":100},{"degree":3,"count":5},{"degree":4,"count":5},{"degree":5,"count":6},{"degree":6,"count":10},{"degree":7,"count":10},{"degree":8,"count":18},{"degree":9,"count":18},{"degree":10,"count":18},{"degree":11,"count":18},{"degree":12,"count":18},{"degree":13,"count":18},{"degree":14,"count":18},{"degree":15,"count":18},{"degree":16,"count":18},{"degree":17,"count":18},{"degree":18,"count":18},{"degree":19,"count":18},{"degree":20,"count":18},{"degree":21,"count":18},{"degree":22,"count":20},{"degree":23,"count":20},{"degree":24,"count":20},{"degree":25,"count":20},{"degree":26,"count":10},"...",{"degree":28,"count":8}, {"degree":29,"count":8}, {"degree":30,"count":9}, {"degree":31,"count":9}, {"degree":32,"count":22}, {"degree":33,"count":5}, {"degree":34,"count":6}, {"degree":35,"count":6}, {"degree":36,"count":7}, {"degree":37,"count":2}, {"degree":38,"count":2}, {"degree":39,"count":2}, {"degree":40,"count":2}, {"degree":41,"count":2}, {"degree":42,"count":2}, {"degree":43,"count":2}, {"degree":44,"count":2}, {"degree":45,"count":2}, {"degree":46,"count":2}, {"degree":47,"count":2}, {"degree":48,"count":2}, {"degree":49,"count":2}, {"degree":50,"count":2}, {"degree":51,"count":3}, {"degree":52,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":2,"count":99},{"arity":3,"count":196},{"arity":4,"count":1},{"arity":5,"count":194},{"arity":6,"count":101},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":10,"count":4},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":2},{"arity":16,"count":2},{"arity":18,"count":1},{"arity":19,"count":2},{"arity":20,"count":3},{"arity":22,"count":3},{"arity":24,"count":1},{"arity":25,"count":4},{"arity":26,"count":1},{"arity":28,"count":3},{"arity":30,"count":3},{"arity":31,"count":2},{"arity":32,"count":1},{"arity":34,"count":3},"...",{"arity":67,"count":2}, {"arity":68,"count":1}, {"arity":70,"count":5}, {"arity":72,"count":1}, {"arity":73,"count":2}, {"arity":74,"count":1}, {"arity":75,"count":2}, {"arity":76,"count":3}, {"arity":78,"count":1}, {"arity":79,"count":2}, {"arity":80,"count":3}, {"arity":82,"count":3}, {"arity":84,"count":1}, {"arity":85,"count":4}, {"arity":86,"count":1}, {"arity":88,"count":3}, {"arity":90,"count":3}, {"arity":91,"count":2}, {"arity":92,"count":1}, {"arity":94,"count":3}, {"arity":95,"count":2}, {"arity":96,"count":1}, {"arity":97,"count":2}, {"arity":98,"count":1}, {"arity":100,"count":6}] |
| Number of extensional constraints | 100 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":100},{"type":"sum","count":636},{"type":"cardinality","count":1}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> opt[][] cls[] </list> <values> 1 0 1 1 1 0 1 0 1 0 1 0 0 0 0 0 1 1 0 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 1 0 0 1 0 0 1 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 0 0 0 0 1 0 1 1 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 1 0 0 1 0 0 1 1 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 1 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 0 0 0 1 0 0 0 0 0 1 1 1 0 1 1 0 1 0 0 0 0 0 1 1 1 1 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 1 0 0 0 1 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 1 0 0 0 1 0 1 1 0 0 1 0 0 0 1 0 0 1 1 0 1 1 0 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 1 0 1 0 1 1 1 1 1 17 2 0 4 5 11 20 8 3 15 2 19 4 11 5 25 1 0 13 0 2 10 14 2 10 2 0 4 11 14 10 2 8 3 12 5 11 6 22 14 0 13 0 3 19 5 18 5 11 20 8 3 15 3 16 4 3 8 7 19 5 22 6 11 14 15 3 8 7 16 5 0 13 22 1 15 5 11 6 9 5 15 3 8 23 8 5 18 5 9 4 0 2 10 21 0 4 0 2 24 </values> </instantiation>