normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/

roussel/normalized-pigeon-cardinality-101-100.opb

Name | normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/ roussel/normalized-pigeon-cardinality-101-100.opb |

MD5SUM | 0b4d976a66cd69333fd390f8a9139e21 |

Bench Category | DEC-SMALLINT-LIN (no 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.207968 |

Has Objective Function | NO |

Satisfiable | NO |

(Un)Satisfiability was proved | YES |

Best value of the objective function | |

Optimality of the best value was proved | |

Number of variables | 10100 |

Total number of constraints | 201 |

Number of constraints which are clauses | 101 |

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

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

Minimum length of a constraint | 100 |

Maximum length of a constraint | 101 |

Number of terms in the objective function | 0 |

Biggest coefficient in the objective function | 0 |

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

Sum of the numbers in the objective function | 0 |

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

Biggest number in a constraint | 1 |

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

Biggest sum of numbers in a constraint | 102 |

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: