0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3488599-1307784216.opb>
0.00/0.00 c original problem has 790 variables (790 bin, 0 int, 0 impl, 0 cont) and 840 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 740 del vars, 100 del conss, 0 add conss, 740 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2960 impls, 0 clqs
0.00/0.03 c (round 2) 740 del vars, 100 del conss, 0 add conss, 740 chg bounds, 0 chg sides, 0 chg coeffs, 740 upgd conss, 2960 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 740 deleted vars, 100 deleted constraints, 0 added constraints, 740 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 4438 implications, 0 cliques
0.00/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 740 constraints
0.00/0.04 c 740 constraints of type <setppc>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.5
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1797
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 13950
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c t 0.0s| 1 | 0 | 50 | - |2575k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.04 o -1
0.00/0.04 c R 0.0s| 1 | 0 | 50 | - |2576k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.04 o -2
0.00/0.04 c s 0.0s| 1 | 0 | 50 | - |2577k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.07 o -5
0.00/0.07 c y 0.1s| 1 | 0 | 50 | - |2627k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-5.000000e+00 | 80.00%
0.00/0.08 c 0.1s| 1 | 0 | 84 | - |2508k| 0 | 40 | 50 | 629 | 50 | 633 | 4 | 0 | 0 |-2.000000e+01 |-5.000000e+00 | 75.00%
0.00/0.09 c 0.1s| 1 | 0 | 137 | - |2515k| 0 | 30 | 50 | 629 | 50 | 640 | 11 | 0 | 0 |-1.500000e+01 |-5.000000e+00 | 66.67%
0.09/0.10 c 0.1s| 1 | 0 | 197 | - |2522k| 0 | 24 | 50 | 629 | 50 | 649 | 20 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.09/0.11 c 0.1s| 1 | 0 | 243 | - |2530k| 0 | 24 | 50 | 629 | 50 | 655 | 26 | 0 | 0 |-1.000000e+01 |-5.000000e+00 | 50.00%
0.09/0.13 c 0.1s| 1 | 0 | 276 | - |2552k| 0 | 23 | 50 | 629 | 50 | 662 | 33 | 0 | 0 |-9.500000e+00 |-5.000000e+00 | 47.37%
0.09/0.14 c 0.1s| 1 | 0 | 313 | - |2586k| 0 | 26 | 50 | 629 | 50 | 670 | 41 | 0 | 0 |-9.166667e+00 |-5.000000e+00 | 45.45%
0.09/0.17 c 0.2s| 1 | 0 | 357 | - |2661k| 0 | 30 | 50 | 629 | 50 | 674 | 45 | 0 | 0 |-8.736842e+00 |-5.000000e+00 | 42.77%
0.19/0.20 c 0.2s| 1 | 0 | 424 | - |2730k| 0 | 27 | 50 | 629 | 50 | 684 | 55 | 0 | 0 |-8.138889e+00 |-5.000000e+00 | 38.57%
0.19/0.22 c 0.2s| 1 | 0 | 490 | - |2854k| 0 | 30 | 50 | 629 | 50 | 689 | 60 | 0 | 0 |-7.882166e+00 |-5.000000e+00 | 36.57%
0.19/0.25 c 0.3s| 1 | 0 | 522 | - |2993k| 0 | 33 | 50 | 629 | 50 | 146 | 68 | 0 | 0 |-7.707865e+00 |-5.000000e+00 | 35.13%
0.19/0.26 c 0.3s| 1 | 0 | 537 | - |3347k| 0 | 34 | 50 | 629 | 50 | 152 | 74 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.19/0.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.27 c 0.3s| 1 | 0 | 556 | - |3680k| 0 | 33 | 50 | 629 | 50 | 158 | 80 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.19/0.28 c 0.3s| 1 | 0 | 570 | - |3792k| 0 | 37 | 50 | 629 | 50 | 165 | 87 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.19/0.29 c 0.3s| 1 | 0 | 583 | - |3925k| 0 | 40 | 50 | 629 | 50 | 172 | 94 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.30 c 0.3s| 1 | 0 | 606 | - |4051k| 0 | 40 | 50 | 629 | 50 | 180 | 102 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.31 c 0.3s| 1 | 0 | 626 | - |4173k| 0 | 43 | 50 | 629 | 50 | 116 | 111 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.36 c 0.4s| 1 | 0 | 640 | - |4131k| 0 | 40 | 50 | 565 | 50 | 116 | 111 | 0 | 14 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.36 c 0.4s| 1 | 0 | 685 | - |4195k| 0 | 36 | 50 | 565 | 50 | 125 | 120 | 0 | 14 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.40 c 0.4s| 1 | 0 | 687 | - |4176k| 0 | 36 | 50 | 536 | 50 | 125 | 120 | 0 | 25 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.40 c 0.4s| 1 | 0 | 727 | - |4265k| 0 | 36 | 50 | 536 | 50 | 130 | 125 | 0 | 25 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.43 c 0.4s| 1 | 0 | 749 | - |4228k| 0 | 37 | 50 | 482 | 50 | 130 | 125 | 0 | 37 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.44 c 0.4s| 1 | 0 | 775 | - |4484k| 0 | 38 | 50 | 482 | 50 | 96 | 133 | 0 | 37 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.45 c 0.5s| 1 | 2 | 775 | - |4485k| 0 | 38 | 50 | 482 | 50 | 96 | 133 | 0 | 45 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.45 c (run 1, node 1) restarting after 8 global fixings of integer variables
0.39/0.45 c
0.39/0.45 c (restart) converted 38 cuts from the global cut pool into linear constraints
0.39/0.45 c
0.39/0.45 c presolving:
0.39/0.46 c (round 1) 8 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 38 upgd conss, 4438 impls, 36 clqs
0.39/0.46 c (round 2) 8 del vars, 318 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 38 upgd conss, 4440 impls, 36 clqs
0.39/0.46 c (round 3) 8 del vars, 318 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 38 upgd conss, 4440 impls, 36 clqs
0.39/0.46 c (round 4) 8 del vars, 318 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 38 upgd conss, 4440 impls, 36 clqs
0.39/0.46 c presolving (5 rounds):
0.39/0.46 c 8 deleted vars, 318 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3 changed coefficients
0.39/0.46 c 4440 implications, 36 cliques
0.39/0.46 c presolved problem has 42 variables (42 bin, 0 int, 0 impl, 0 cont) and 202 constraints
0.39/0.46 c 2 constraints of type <knapsack>
0.39/0.46 c 200 constraints of type <setppc>
0.39/0.46 c transformed objective value is always integral (scale: 1)
0.39/0.46 c Presolving Time: 0.04
0.39/0.46 c
0.39/0.46 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.46 c 0.5s| 1 | 0 | 860 | - |2265k| 0 | 21 | 42 | 202 | 42 | 202 | 0 | 0 | 45 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.47 c 0.5s| 1 | 0 | 883 | - |2366k| 0 | 29 | 42 | 194 | 42 | 201 | 7 | 0 | 45 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.39/0.49 c 0.5s| 1 | 0 | 926 | - |2351k| 0 | 30 | 42 | 144 | 42 | 201 | 7 | 0 | 60 |-6.986395e+00 |-5.000000e+00 | 28.43%
0.49/0.51 c 0.5s| 1 | 0 | 926 | - |2348k| 0 | - | 42 | 144 | 42 | 201 | 7 | 0 | 82 |-6.986395e+00 |-5.000000e+00 | 28.43%
0.49/0.51 c (run 2, node 1) restarting after 10 global fixings of integer variables
0.49/0.51 c
0.49/0.51 c (restart) converted 7 cuts from the global cut pool into linear constraints
0.49/0.51 c
0.49/0.51 c presolving:
0.49/0.51 c (round 1) 10 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 7 upgd conss, 4440 impls, 42 clqs
0.49/0.51 c (round 2) 10 del vars, 62 del conss, 3 add conss, 0 chg bounds, 3 chg sides, 17 chg coeffs, 7 upgd conss, 4440 impls, 44 clqs
0.49/0.52 c (round 3) 10 del vars, 62 del conss, 3 add conss, 0 chg bounds, 3 chg sides, 20 chg coeffs, 7 upgd conss, 4440 impls, 44 clqs
0.49/0.52 c (round 4) 10 del vars, 62 del conss, 3 add conss, 0 chg bounds, 3 chg sides, 21 chg coeffs, 7 upgd conss, 4440 impls, 44 clqs
0.49/0.52 c (round 5) 10 del vars, 62 del conss, 3 add conss, 0 chg bounds, 3 chg sides, 22 chg coeffs, 7 upgd conss, 4440 impls, 44 clqs
0.49/0.52 c presolving (6 rounds):
0.49/0.52 c 10 deleted vars, 62 deleted constraints, 3 added constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 22 changed coefficients
0.49/0.52 c 4440 implications, 44 cliques
0.49/0.52 c presolved problem has 32 variables (32 bin, 0 int, 0 impl, 0 cont) and 92 constraints
0.49/0.52 c 3 constraints of type <knapsack>
0.49/0.52 c 89 constraints of type <setppc>
0.49/0.52 c transformed objective value is always integral (scale: 1)
0.49/0.52 c Presolving Time: 0.04
0.49/0.52 c
0.49/0.52 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.52 c 0.5s| 1 | 0 | 1005 | - |2177k| 0 | 23 | 32 | 92 | 32 | 92 | 0 | 0 | 82 |-6.800000e+00 |-5.000000e+00 | 26.47%
0.49/0.52 c 0.5s| 1 | 0 | 1023 | - |2241k| 0 | 24 | 32 | 92 | 32 | 98 | 6 | 0 | 82 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.53 c 0.5s| 1 | 0 | 1036 | - |2233k| 0 | 24 | 32 | 78 | 32 | 98 | 6 | 0 | 106 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.54 c 0.5s| 1 | 0 | 1037 | - |2232k| 0 | 22 | 32 | 75 | 32 | 98 | 6 | 0 | 111 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.54 c 0.5s| 1 | 2 | 1037 | - |2232k| 0 | 22 | 32 | 75 | 32 | 98 | 6 | 0 | 111 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.54 c (run 3, node 1) restarting after 6 global fixings of integer variables
0.49/0.54 c
0.49/0.54 c (restart) converted 3 cuts from the global cut pool into linear constraints
0.49/0.54 c
0.49/0.54 c presolving:
0.49/0.54 c (round 1) 6 del vars, 5 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 3 upgd conss, 4440 impls, 41 clqs
0.49/0.54 c (round 2) 6 del vars, 6 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 3 upgd conss, 4440 impls, 42 clqs
0.49/0.54 c (round 3) 6 del vars, 6 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 3 upgd conss, 4440 impls, 42 clqs
0.49/0.54 c presolving (4 rounds):
0.49/0.54 c 6 deleted vars, 6 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 5 changed coefficients
0.49/0.54 c 4440 implications, 42 cliques
0.49/0.54 c presolved problem has 26 variables (26 bin, 0 int, 0 impl, 0 cont) and 72 constraints
0.49/0.54 c 4 constraints of type <knapsack>
0.49/0.54 c 68 constraints of type <setppc>
0.49/0.54 c transformed objective value is always integral (scale: 1)
0.49/0.54 c Presolving Time: 0.05
0.49/0.54 c
0.49/0.54 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.54 c 0.5s| 1 | 0 | 1074 | - |2153k| 0 | 15 | 26 | 72 | 26 | 72 | 0 | 0 | 111 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.54 c 0.5s| 1 | 0 | 1084 | - |2173k| 0 | 21 | 26 | 72 | 26 | 77 | 5 | 0 | 111 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.55 c 0.5s| 1 | 0 | 1085 | - |2172k| 0 | 13 | 26 | 68 | 26 | 77 | 5 | 0 | 132 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.55 o -5
0.49/0.55 c s 0.5s| 1 | 0 | 1085 | - |2172k| 0 | 13 | 26 | 68 | 26 | 77 | 5 | 0 | 132 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.49/0.56 o -6
0.49/0.56 c E 0.6s| 1 | 0 | 1085 | - |2174k| 0 | - | 26 | 68 | 26 | 77 | 5 | 0 | 132 |-6.000000e+00 |-6.000000e+00 | 0.00%
0.49/0.56 c
0.49/0.56 c SCIP Status : problem is solved [optimal solution found]
0.49/0.56 c Solving Time (sec) : 0.56
0.49/0.56 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.49/0.56 c Primal Bound : -6.00000000000000e+00 (10 solutions)
0.49/0.56 c Dual Bound : -6.00000000000000e+00
0.49/0.56 c Gap : 0.00 %
0.49/0.56 s OPTIMUM FOUND
0.49/0.56 v -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 -x25
0.49/0.56 v -x24 x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
0.49/0.56 c SCIP Status : problem is solved [optimal solution found]
0.49/0.56 c Total Time : 0.56
0.49/0.56 c solving : 0.56
0.49/0.56 c presolving : 0.05 (included in solving)
0.49/0.56 c reading : 0.00 (included in solving)
0.49/0.56 c Original Problem :
0.49/0.56 c Problem name : HOME/instance-3488599-1307784216.opb
0.49/0.56 c Variables : 790 (790 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.56 c Constraints : 840 initial, 840 maximal
0.49/0.56 c Presolved Problem :
0.49/0.56 c Problem name : t_HOME/instance-3488599-1307784216.opb
0.49/0.56 c Variables : 26 (26 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.56 c Constraints : 72 initial, 72 maximal
0.49/0.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.56 c trivial : 0.00 24 0 0 0 0 0 0 0 0
0.49/0.56 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.56 c knapsack : 0.01 0 0 0 0 0 0 3 3 30
0.49/0.56 c setppc : 0.01 0 0 0 0 0 386 0 0 0
0.49/0.56 c and : 0.02 0 0 0 0 0 0 0 0 0
0.49/0.56 c linear : 0.00 740 0 0 740 0 50 0 0 0
0.49/0.56 c pseudoboolean : 0.00 0 0 0 0 0 50 0 0 0
0.49/0.56 c root node : - 25 - - 25 - - - - -
0.49/0.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.56 c integral : 0 0 0 11 0 17 0 0 21 0 0 6
0.49/0.56 c knapsack : 4 3 8 0 0 0 0 0 0 0 0 0
0.49/0.56 c setppc : 68 22 65 0 0 10 0 0 0 0 0 0
0.49/0.56 c countsols : 0 0 0 0 0 12 0 0 0 0 0 0
0.49/0.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.56 c integral : 0.18 0.00 0.00 0.18 0.00 0.00 0.00
0.49/0.56 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.56 c vbounds : 0 0 0 0
0.49/0.56 c rootredcost : 0 0 0 0
0.49/0.56 c pseudoobj : 30 0 0 0
0.49/0.56 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.56 c vbounds : 0.00 0.00 0.00
0.49/0.56 c rootredcost : 0.00 0.00 0.00
0.49/0.56 c pseudoobj : 0.00 0.00 0.00
0.49/0.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.56 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.56 c applied globally : - - - 0 0.0 - - -
0.49/0.56 c applied locally : - - - 0 0.0 - - -
0.49/0.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.56 c cut pool : 0.00 0 - - 0 - (maximal pool size: 23)
0.49/0.56 c redcost : 0.00 22 0 1 0 0
0.49/0.56 c impliedbounds : 0.00 22 0 0 0 0
0.49/0.56 c intobj : 0.00 0 0 0 0 0
0.49/0.56 c gomory : 0.10 22 0 0 4353 0
0.49/0.56 c cgmip : 0.00 0 0 0 0 0
0.49/0.56 c closecuts : 0.00 0 0 0 0 0
0.49/0.56 c strongcg : 0.09 22 0 0 4867 0
0.49/0.56 c cmir : 0.01 13 0 0 0 0
0.49/0.56 c flowcover : 0.01 13 0 0 0 0
0.49/0.56 c clique : 0.01 22 0 0 177 0
0.49/0.56 c zerohalf : 0.00 0 0 0 0 0
0.49/0.56 c mcf : 0.00 4 0 0 0 0
0.49/0.56 c oddcycle : 0.00 0 0 0 0 0
0.49/0.56 c rapidlearning : 0.02 1 0 3 0 0
0.49/0.56 c Pricers : Time Calls Vars
0.49/0.56 c problem variables: 0.00 0 0
0.49/0.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.56 c relpscost : 0.18 11 0 21 0 0 6
0.49/0.56 c pscost : 0.00 0 0 0 0 0 0
0.49/0.56 c inference : 0.00 0 0 0 0 0 0
0.49/0.56 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.56 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.56 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.56 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.56 c random : 0.00 0 0 0 0 0 0
0.49/0.56 c Primal Heuristics : Time Calls Found
0.49/0.56 c LP solutions : 0.00 - 0
0.49/0.56 c pseudo solutions : 0.00 - 0
0.49/0.56 c crossover : 0.00 0 0
0.49/0.56 c oneopt : 0.00 1 0
0.49/0.56 c trivial : 0.00 2 1
0.49/0.56 c shiftandpropagate: 0.00 0 0
0.49/0.56 c simplerounding : 0.00 33 0
0.49/0.56 c zirounding : 0.00 2 2
0.49/0.56 c rounding : 0.00 33 1
0.49/0.56 c shifting : 0.00 33 4
0.49/0.56 c intshifting : 0.00 0 0
0.49/0.56 c twoopt : 0.00 0 0
0.49/0.56 c fixandinfer : 0.00 0 0
0.49/0.56 c feaspump : 0.00 0 0
0.49/0.56 c clique : 0.00 0 0
0.49/0.56 c coefdiving : 0.00 0 0
0.49/0.56 c pscostdiving : 0.00 0 0
0.49/0.56 c fracdiving : 0.00 0 0
0.49/0.56 c veclendiving : 0.00 0 0
0.49/0.56 c intdiving : 0.00 0 0
0.49/0.56 c actconsdiving : 0.00 0 0
0.49/0.56 c objpscostdiving : 0.00 0 0
0.49/0.56 c rootsoldiving : 0.00 0 0
0.49/0.56 c linesearchdiving : 0.00 0 0
0.49/0.56 c guideddiving : 0.00 0 0
0.49/0.56 c octane : 0.00 0 0
0.49/0.56 c rens : 0.02 1 1
0.49/0.56 c rins : 0.00 0 0
0.49/0.56 c localbranching : 0.00 0 0
0.49/0.56 c mutation : 0.00 0 0
0.49/0.56 c dins : 0.00 0 0
0.49/0.56 c vbounds : 0.00 0 0
0.49/0.56 c undercover : 0.01 1 0
0.49/0.56 c subnlp : 0.00 0 0
0.49/0.56 c trysol : 0.00 0 0
0.49/0.56 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.56 c primal LP : 0.00 0 0 0.00 -
0.49/0.56 c dual LP : 0.03 34 1085 31.91 33174.34
0.49/0.56 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.56 c barrier LP : 0.00 0 0 0.00 -
0.49/0.56 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.56 c strong branching : 0.18 132 7327 55.51 41182.59
0.49/0.56 c (at root node) : - 132 7327 55.51 -
0.49/0.56 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.56 c B&B Tree :
0.49/0.56 c number of runs : 4
0.49/0.56 c nodes : 1
0.49/0.56 c nodes (total) : 4
0.49/0.56 c nodes left : 0
0.49/0.56 c max depth : 0
0.49/0.56 c max depth (total): 0
0.49/0.56 c backtracks : 0 (0.0%)
0.49/0.56 c delayed cutoffs : 0
0.49/0.56 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.56 c avg switch length: 2.00
0.49/0.56 c switching time : 0.00
0.49/0.56 c Solution :
0.49/0.56 c Solutions found : 10 (6 improvements)
0.49/0.56 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.49/0.56 c Primal Bound : -6.00000000000000e+00 (in run 4, after 1 nodes, 0.56 seconds, depth 0, found by <rens>)
0.49/0.56 c Dual Bound : -6.00000000000000e+00
0.49/0.56 c Gap : 0.00 %
0.49/0.56 c Root Dual Bound : -6.00000000000000e+00
0.49/0.56 c Root Iterations : 1085
0.49/0.57 c Time complete: 0.56.