/OPT-SMALLINT-LIN/heinz/

normalized-neos788725.opb

Name | /OPT-SMALLINT-LIN/heinz/ normalized-neos788725.opb |

MD5SUM | 8629904c9ea425e42543cd04547905ca |

Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |

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 | 151.049 |

Has Objective Function | YES |

Satisfiable | |

(Un)Satisfiability was proved | |

Best value of the objective function | |

Optimality of the best value was proved | |

Number of variables | 352 |

Total number of constraints | 433 |

Number of constraints which are clauses | 304 |

Number of constraints which are cardinality constraints (but not clauses) | 33 |

Number of constraints which are nor clauses,nor cardinality constraints | 96 |

Minimum length of a constraint | 2 |

Maximum length of a constraint | 96 |

Number of terms in the objective function | 96 |

Biggest coefficient in the objective function | 1 |

Number of bits for the biggest coefficient in the objective function | 1 |

Sum of the numbers in the objective function | 96 |

Number of bits of the sum of numbers in the objective function | 7 |

Biggest number in a constraint | 9 |

Number of bits of the biggest number in a constraint | 4 |

Biggest sum of numbers in a constraint | 105 |

Number of bits of the biggest sum of numbers | 7 |

Number of products (including duplicates) | 0 |

Sum of products size (including duplicates) | 0 |

Number of different products | 0 |

Sum of products size | 0 |

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:Solution found: