PB'06 evaluation: solvers results per benchmarks

Result page for benchmark
normalized-PB06/OPT-BIGINT/mps-v2-20-10/MIPLIB/
miplib/normalized-mps-v2-20-10-sample2.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB06/OPT-BIGINT/mps-v2-20-10/MIPLIB/
miplib/normalized-mps-v2-20-10-sample2.opb
MD5SUMf72f6e3cf70b31c2d253740c5b04c4f6
Bench CategoryOPT-BIGINT (optimisation, big integers)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark384000
Best CPU time to get the best result obtained on this benchmark19.682
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 384000
Optimality of the best value was proved YES
Number of variables1296
Total number of constraints46
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)3
Number of constraints which are nor clauses,nor cardinality constraints43
Minimum length of a constraint4
Maximum length of a constraint150
Number of terms in the objective function 729
Biggest coefficient in the objective function 3221225472
Number of bits for the biggest coefficient in the objective function 32
Sum of the numbers in the objective function 70867574718
Number of bits of the sum of numbers in the objective function 37
Biggest number in a constraint 3221225472
Number of bits of the biggest number in a constraint 32
Biggest sum of numbers in a constraint 70867574718
Number of bits of the biggest sum of numbers37
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerObjective functionCPU timeWall clock time
minisat+ 1.1435841OPT384000 19.682 19.69
bsolo 2006/0540721SAT384000 1800.1 1800.72
SAT4JPSEUDO 2006.2 Heuristics43301SAT (TO)384000 1800.81 1786.55
SAT4JPSEUDO 2006.244731? (TO) 1800.79 1784.43