/OPT-SMALLINT-LIN/heinz/

normalized-ash608gpia-3col.opb

Name | /OPT-SMALLINT-LIN/heinz/ normalized-ash608gpia-3col.opb |

MD5SUM | 696c54482af0fb105b046108be2773d2 |

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

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

Total number of constraints | 24748 |

Number of constraints which are clauses | 0 |

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

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

Minimum length of a constraint | 3 |

Maximum length of a constraint | 3 |

Number of terms in the objective function | 3 |

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

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

Biggest number in a constraint | 1 |

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

Biggest sum of numbers in a constraint | 4 |

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

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: