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

Jump to solvers results

General information on the benchmark

Namesubmitted/manquinho/primes-dimacs-cnf/normalized-aim-100-6_0-yes1-2.opb
MD5SUM836a2af811b965a64fa1fd6f7031339b
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 100
Optimality of the best value was proved YES
Number of terms in the objective function 200
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 200
Number of bits of the sum of numbers in the objective function 8
Biggest number in a constraint 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 200
Number of bits of the biggest sum of numbers8
Best result obtained on this benchmarkOPTIMUM FOUND
Best CPU time to get the best result obtained on this benchmark0.044992
Number of variables200
Total number of constraints700
Number of constraints which are clauses699
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint3

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
PBS4937OPT 0.044992
Pueblo7587OPT 0.054991
galena742OPT 0.065989
minisat+838OPT 0.142977
bsolo108OPT 0.225964
vallst_0.9.2581237OPT 0.494923
pb2sat+zchaff9529OPT 1.46378
sat4jpseudo1139OPT 5.87311