Name | /SOFT-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/ tsp/normalized-t3002.11tsp11.1900553812--soft-0-100-0.wbo |
MD5SUM | 10c8366d87b8e61a0f23df601b3f0e14 |
Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 3 |
Best CPU time to get the best result obtained on this benchmark | 60.7228 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 231 |
Total number of constraints | 2707 |
Number of soft constraints | 2707 |
Number of constraints which are clauses | 2684 |
Number of constraints which are cardinality constraints (but not clauses) | 22 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 110 |
Top cost | 136614 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 136613 |
Biggest number in a constraint | 25 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 723 |
Number of bits of the biggest sum of numbers | 10 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448013 | OPTIMUM | 60.7228 | 60.7249 |
Sat4j Resolution 2011-06-08 (complete) | 3492089 | OPTIMUM | 282.867 | 280.613 |
wbo 1.6 (complete) | 3446570 | OPTIMUM | 308.989 | 308.982 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447307 | MSAT (TO) | 1800.14 | 1800.07 |
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: 3-x228 -x229 -x230 -x231