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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-par8-2-c.opb
MD5SUM6426d07b9a45c1ddc8ddbec58612957d
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 68
Optimality of the best value was proved YES
Number of terms in the objective function 136
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 136
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 136
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.023995
Number of variables136
Total number of constraints338
Number of constraints which are clauses338
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 constraint3

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
PBS41595OPT 0.023995
Pueblo7702OPT 0.027995
galena1401OPT 0.039993
minisat+1495OPT 0.101984
bsolo208OPT 0.12698
vallst_0.9.2581895OPT 0.348946
pb2sat+zchaff9639OPT 0.702893
sat4jpseudo1795OPT 5.17221