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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-ii32b1.opb
MD5SUMc4653389ddee2820797c664a0856c651
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 191
Optimality of the best value was proved YES
Number of terms in the objective function 456
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 456
Number of bits of the sum of numbers in the objective function 9
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 456
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 benchmark133.451
Number of variables456
Total number of constraints1602
Number of constraints which are clauses1602
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 constraint32

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
minisat+1435OPT 133.451
galena1338SAT 1.07384
Pueblo7695SAT 1189.03
bsolo190SAT 1195.05
pb2sat+zchaff9632SAT TO 1208.13
sat4jpseudo1771SAT TO 1258.54
vallst_0.9.2581888UNKNOWN TO 1202.66
PBS41578UNKNOWN TO 1207.4