| Name | CarSequencing/ CarSequencing-04-72_c18.xml |
| MD5SUM | 606ad4221d4941292d84c5bdd64a5487 |
| 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 | 18.6809 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 600 |
| Number of constraints | 731 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 22 |
| Distribution of domain sizes | [{"size":2,"count":500},{"size":22,"count":100}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 53 |
| 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":19},{"degree":21,"count":19},{"degree":22,"count":20},{"degree":23,"count":20},{"degree":24,"count":25},{"degree":25,"count":14},{"degree":26,"count":9},"...",{"degree":29,"count":9}, {"degree":30,"count":10}, {"degree":31,"count":26}, {"degree":32,"count":19}, {"degree":33,"count":2}, {"degree":34,"count":2}, {"degree":35,"count":2}, {"degree":36,"count":2}, {"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":2}, {"degree":52,"count":3}, {"degree":53,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":2,"count":100},{"arity":3,"count":196},{"arity":4,"count":1},{"arity":5,"count":193},{"arity":6,"count":101},{"arity":8,"count":1},{"arity":10,"count":2},{"arity":12,"count":1},{"arity":14,"count":1},{"arity":15,"count":2},{"arity":16,"count":1},{"arity":18,"count":1},{"arity":19,"count":1},{"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":35,"count":2},{"arity":36,"count":1},"...",{"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":630},{"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> cls[] opt[][] </list> <values> 13 4 1 5 14 7 14 12 1 16 19 3 0 5 11 4 18 7 18 15 4 1 4 14 9 0 15 0 5 1 4 2 6 14 5 8 5 13 3 14 12 10 12 14 5 13 5 10 12 14 15 1 4 19 9 2 5 8 12 14 15 18 7 0 5 1 16 14 12 19 9 17 5 19 4 1 5 17 7 0 5 1 16 19 7 18 5 20 12 0 5 1 16 19 4 1 5 14 12 21 1 0 0 1 1 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 1 0 1 1 1 0 0 0 0 0 0 1 1 1 0 1 0 0 1 1 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 0 1 0 0 0 1 0 1 1 0 0 0 0 0 1 1 0 1 1 0 0 0 0 1 0 0 1 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 1 0 1 1 0 0 1 0 1 1 1 0 1 0 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 0 1 0 0 0 0 0 1 0 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 1 1 1 1 0 0 0 0 0 1 0 1 1 0 1 0 0 0 1 0 0 1 1 0 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 1 0 1 1 0 1 0 0 0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 1 0 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 0 1 1 1 1 1 </values> </instantiation>