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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-ii32c3.opb
MD5SUM00d830716ad6728e4af33fe898d69922
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 261
Optimality of the best value was proved YES
Number of terms in the objective function 558
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 558
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 558
Number of bits of the biggest sum of numbers10
Best result obtained on this benchmarkOPTIMUM FOUND
Best CPU time to get the best result obtained on this benchmark316.875
Number of variables558
Total number of constraints3551
Number of constraints which are clauses3551
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+1456OPT 316.875
galena1344SAT 1.07184
Pueblo7698SAT 1189.01
bsolo202SAT 1195.32
pb2sat+zchaff9640SAT TO 1208.01
sat4jpseudo1781SAT TO 1245.58
PBS41586UNKNOWN TO 1206.07
vallst_0.9.2581889UNKNOWN TO 1207.3