PB'11 competition: WBO track: solvers results per benchmarks

Result page for benchmark
/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/
normalized-t3002.11tsp11.1900669797--soft-66-100-0.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/
normalized-t3002.11tsp11.1900669797--soft-66-100-0.wbo
MD5SUMed627c94e924dd829be1b38440fce2ad
Bench CategoryPARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints)
Best result obtained on this benchmarkMOPT
Best cost obtained on this benchmark1
Best CPU time to get the best result obtained on this benchmark43.7174
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables231
Total number of constraints2707
Number of soft constraints911
Number of constraints which are clauses2684
Number of constraints which are cardinality constraints (but not clauses)22
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint110
Top cost 45526
Min constraint cost 1
Max constraint cost 100
Sum of constraints costs 45525
Biggest number in a constraint 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 695
Number of bits of the biggest sum of numbers10
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
clasp 2.0-RC2 (complete)3448624OPTIMUM 43.7174 43.7172
wbo 1.6 (complete)3447145OPTIMUM 208.149 208.147
Sat4j Resolution 2011-06-08 (complete)3492731OPTIMUM 350.666 348.173
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete)3447882OPTIMUM 1173.68 1173.65

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

cost of falsified constraints: 1
Solution found:
-x229 -x230 -x231