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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-f1000.opb
MD5SUM3b740c03d309134e8e181ea08fc4a1e3
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of terms in the objective function 2000
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 2000
Number of bits of the sum of numbers in the objective function 11
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 2000
Number of bits of the biggest sum of numbers11
Best result obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Number of variables2000
Total number of constraints5250
Number of constraints which are clauses5250
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
galena1319UNKNOWN 1.06084
bsolo163UNKNOWN 1195.08
minisat+1459UNKNOWN TO 1200
Pueblo7651UNKNOWN TO 1200.18
PBS41544UNKNOWN TO 1203
vallst_0.9.2581860UNKNOWN TO 1203.12
pb2sat+zchaff9601UNKNOWN TO 1204.37
sat4jpseudo1745UNKNOWN TO 1226.72