Result page for benchmark submitted/manquinho/primes-dimacs-cnf/normalized-aim-100-6_0-yes1-3.opb

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-aim-100-6_0-yes1-3.opb
MD5SUMcd522e3077197e6f8d61bed002e69f90
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 100
Optimality of the best value was proved YES
Number of terms in the objective function 200
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 200
Number of bits of the sum of numbers in the objective function 8
Biggest number in a constraint 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 200
Number of bits of the biggest sum of numbers8
Best result obtained on this benchmarkOPTIMUM FOUND
Best CPU time to get the best result obtained on this benchmark0.039992
Number of variables200
Total number of constraints700
Number of constraints which are clauses698
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints2
Minimum length of a constraint2
Maximum length of a constraint3

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
PBS42327OPT 0.039992
Pueblo7718OPT 0.044992
minisat+2132OPT 0.054991
galena1928OPT 0.062989
bsolo224OPT 0.25296
vallst_0.9.2583425OPT 0.498923
pb2sat+zchaff9655OPT 1.40879
sat4jpseudo3127OPT 7.77782