/OPT-BIGINT-LIN/zahidi/Multihop/

normalized-minisat50_6_9_0_mh.opb

Name | /OPT-BIGINT-LIN/zahidi/Multihop/ normalized-minisat50_6_9_0_mh.opb |

MD5SUM | 52afec4ffbbd6f0999256966f3f490ed |

Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |

Best result obtained on this benchmark | SAT |

Best value of the objective obtained on this benchmark | 4664822 |

Best CPU time to get the best result obtained on this benchmark | 1800.89 |

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

Total number of constraints | 605407 |

Number of constraints which are clauses | 477850 |

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

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

Minimum length of a constraint | 2 |

Maximum length of a constraint | 3725 |

Number of terms in the objective function | 129900 |

Biggest coefficient in the objective function | 145531576 |

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

Sum of the numbers in the objective function | 65051092014 |

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

Biggest number in a constraint | 145531576 |

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

Biggest sum of numbers in a constraint | 65051092014 |

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

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: 42968412Solution found:

--too large--