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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-ii8b1.opb
MD5SUM812314147c77e28d5e428080c7a2412d
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 NO
Number of terms in the objective function 672
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 672
Number of bits of the sum of numbers in the objective function 10
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 672
Number of bits of the biggest sum of numbers10
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark1195.08
Number of variables672
Total number of constraints2404
Number of constraints which are clauses2404
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 constraint8

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
galena1358SAT 1.05184
Pueblo7724SAT 1189.01
bsolo235SAT 1195.08
pb2sat+zchaff9677SAT TO 1207.59
sat4jpseudo1819SAT TO 1259.24
vallst_0.9.2581907UNKNOWN TO 1202.12
PBS41724UNKNOWN TO 1205.28
minisat+1522UNKNOWN TO 1209.61