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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-par16-2.opb
MD5SUMff021c96fa8729c0ff59034e5dd63ec7
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 1015
Optimality of the best value was proved YES
Number of terms in the objective function 2030
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 2030
Number of bits of the sum of numbers in the objective function 11
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 2030
Number of bits of the biggest sum of numbers11
Best result obtained on this benchmarkOPTIMUM FOUND
Best CPU time to get the best result obtained on this benchmark42.4355
Number of variables2030
Total number of constraints4389
Number of constraints which are clauses4389
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 constraint1
Maximum length of a constraint3

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
minisat+2143OPT 42.4355
Pueblo7729OPT 62.0786
vallst_0.9.2583440OPT 76.3024
bsolo248OPT 134.667
PBS42352OPT 144.486
sat4jpseudo3174OPT 1255.71
galena1941UNKNOWN 1.03584
pb2sat+zchaff9680UNKNOWN EXCODE 184.983