Result page for benchmark submitted/sorensson/garden/normalized-g9x3.opb

Jump to solvers results

General information on the benchmark

Namesubmitted/sorensson/garden/normalized-g9x3.opb
MD5SUM7b2b6938169f14f87a8652ff15c90440
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 7
Optimality of the best value was proved YES
Number of terms in the objective function 27
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 27
Number of bits of the sum of numbers in the objective function 5
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 27
Number of bits of the biggest sum of numbers5
Best result obtained on this benchmarkOPTIMUM FOUND
Best CPU time to get the best result obtained on this benchmark0.010997
Number of variables27
Total number of constraints27
Number of constraints which are clauses27
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 constraint3
Maximum length of a constraint5

Results of the different solvers on this benchmark

Solver NameTraceidAnswerCPU time
galena1980OPT 0.010997
Pueblo7768OPT 0.024995
minisat+2177OPT 0.050991
pb2sat+zchaff9704OPT 0.084986
PBS42376OPT 0.497923
vallst_0.9.2583476OPT 0.560914
bsolo275OPT 3.82742
sat4jpseudo3173OPT 5.97009