/OPT-SMALLINT-LIN/oliveras/j120opt/

normalized-j12052_2.std.opb

Name | /OPT-SMALLINT-LIN/oliveras/j120opt/ normalized-j12052_2.std.opb |

MD5SUM | 38fb0c3d6aceb5f008836e7f9c186fab |

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

Best result obtained on this benchmark | SAT |

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

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

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

Total number of constraints | 256243 |

Number of constraints which are clauses | 255043 |

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

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

Minimum length of a constraint | 1 |

Maximum length of a constraint | 98 |

Number of terms in the objective function | 300 |

Biggest coefficient in the objective function | 300 |

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

Sum of the numbers in the objective function | 45150 |

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

Biggest number in a constraint | 300 |

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

Biggest sum of numbers in a constraint | 45150 |

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

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

--too large--