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

Jump to solvers results

General information on the benchmark

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

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
minisat+1403OPT 0.086986
Pueblo7600OPT 0.115981
galena1297OPT 0.135979
PBS41497OPT 0.293955
bsolo126OPT 1.02684
vallst_0.9.2581798OPT 2.33864
pb2sat+zchaff9547OPT 7.13891
sat4jpseudo1698OPT 12.2801