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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-aim-200-2_0-yes1-2.opb
MD5SUM207b7afaccb47d7f1cd8a6ea33b99e7d
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.055991
Number of variables400
Total number of constraints600
Number of constraints which are clauses599
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint3

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
Pueblo7594OPT 0.055991
galena749OPT 0.084986
PBS4944OPT 0.114981
minisat+845OPT 0.313951
bsolo118OPT 0.402938
vallst_0.9.2581244OPT 2.24766
pb2sat+zchaff9538OPT 6.587
sat4jpseudo1147OPT 8.70368