Result page for benchmark submitted/manquinho/primes-dimacs-cnf/normalized-jnh209.opb

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-jnh209.opb
MD5SUMad3e64e9cdbd56e02705ba9162b58982
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 93
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 1
Number of bits of the biggest number in a constraint 1
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.195969
Number of variables200
Total number of constraints900
Number of constraints which are clauses900
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint11

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
Pueblo7675OPT 0.195969
PBS41570OPT 0.218966
galena1373OPT 0.298954
minisat+1471OPT 0.543916
bsolo182OPT 1.43178
vallst_0.9.2581869OPT 2.73258
pb2sat+zchaff9614OPT 3.84541
sat4jpseudo1769OPT 12.7461