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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-par16-3.opb
MD5SUM0c5e732518faa634f5236b6dfdf30123
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 benchmark5.50716
Number of variables2030
Total number of constraints4359
Number of constraints which are clauses4359
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+1483OPT 5.50716
Pueblo7689OPT 16.4225
vallst_0.9.2581884OPT 61.5276
PBS41590OPT 130.872
bsolo249SAT 1196.23
sat4jpseudo1833SAT TO 1247.55
galena1385UNKNOWN 1.04184
pb2sat+zchaff9627UNKNOWN EXCODE 168.343