Result page for benchmark submitted/manquinho/primes-dimacs-cnf/normalized-aim-200-6_0-yes1-1.opb

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-aim-200-6_0-yes1-1.opb
MD5SUM8383ae77f8417c3caa791651bc2db13b
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 200
Optimality of the best value was proved YES
Number of terms in the objective function 400
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 400
Number of bits of the sum of numbers in the objective function 9
Biggest number in a constraint 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 400
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 benchmark0.074988
Number of variables400
Total number of constraints1400
Number of constraints which are clauses1392
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints8
Minimum length of a constraint2
Maximum length of a constraint3

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
PBS4950OPT 0.074988
minisat+851OPT 0.130979
Pueblo7601OPT 0.154976
galena755OPT 0.172973
bsolo124OPT 0.449931
vallst_0.9.2581251OPT 2.22466
pb2sat+zchaff9543OPT 6.07908
sat4jpseudo1155OPT 9.39457