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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-ii32d2.opb
MD5SUMa483fc3761bb4050329265bf3a3a7ca5
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 372
Optimality of the best value was proved NO
Number of terms in the objective function 808
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 808
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 808
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 benchmark1.09383
Number of variables808
Total number of constraints5557
Number of constraints which are clauses5557
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+1518ERR NOCERT 1209.43
galena1346SAT 1.09383
Pueblo7700SAT 1189.12
bsolo204SAT 1195.37
pb2sat+zchaff9653SAT TO 1209.54
sat4jpseudo1783SAT TO 1246.44
PBS41592UNKNOWN TO 1203.15
vallst_0.9.2581896UNKNOWN TO 1208.94