0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2666741-1276670867.opb>
0.00/0.01 c original problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.00/0.01 c problem read
0.00/0.01 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.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 388 impls, 20 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 2718 implications, 20 cliques
0.00/0.03 c presolved problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.00/0.03 c 20 constraints of type <setppc>
0.00/0.03 c 46 constraints of type <and>
0.00/0.03 c 1 constraints of type <linear>
0.00/0.03 c 10 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c heuristics/undercover/freq = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 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 | 129 | - | 490k| 0 | 49 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.04 o -1
0.00/0.04 c s 0.0s| 1 | 0 | 129 | - | 492k| 0 | 49 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e-00 | 80.00%
0.09/0.10 o -2
0.09/0.10 c u 0.1s| 1 | 0 | 129 | - | 493k| 0 | 49 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 |-2.000000e+00 | 60.00%
0.19/0.21 o -3
0.19/0.21 c y 0.1s| 1 | 0 | 129 | - | 647k| 0 | 49 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.19/0.22 c 0.1s| 1 | 0 | 206 | - | 802k| 0 | 39 | 66 | 287 | 66 | 146 | 44 | 0 | 0 |-4.858472e+00 |-3.000000e+00 | 38.25%
0.19/0.24 c 0.1s| 1 | 0 | 237 | - | 878k| 0 | 39 | 66 | 287 | 66 | 156 | 54 | 0 | 0 |-4.780997e+00 |-3.000000e+00 | 37.25%
0.19/0.25 c 0.2s| 1 | 0 | 270 | - | 912k| 0 | 33 | 66 | 287 | 66 | 173 | 71 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.27 c 0.2s| 1 | 0 | 307 | - | 951k| 0 | 35 | 66 | 287 | 66 | 187 | 85 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.30 c 0.2s| 1 | 0 | 355 | - | 990k| 0 | 29 | 66 | 287 | 66 | 194 | 92 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.32 c 0.2s| 1 | 0 | 382 | - |1004k| 0 | 31 | 66 | 287 | 66 | 199 | 97 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.34 c 0.2s| 1 | 0 | 468 | - |1021k| 0 | 30 | 66 | 287 | 66 | 209 | 107 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.37 c 0.3s| 1 | 0 | 568 | - |1036k| 0 | 31 | 66 | 287 | 66 | 213 | 111 | 0 | 0 |-4.492754e+00 |-3.000000e+00 | 33.23%
0.29/0.39 c 0.3s| 1 | 0 | 599 | - |1060k| 0 | 28 | 66 | 287 | 66 | 218 | 116 | 0 | 0 |-4.486850e+00 |-3.000000e+00 | 33.14%
0.39/0.42 c 0.3s| 1 | 0 | 630 | - |1094k| 0 | 30 | 66 | 287 | 66 | 178 | 120 | 0 | 0 |-4.475577e+00 |-3.000000e+00 | 32.97%
0.39/0.44 c 0.3s| 1 | 0 | 653 | - |1141k| 0 | 33 | 66 | 287 | 66 | 183 | 125 | 0 | 0 |-4.473577e+00 |-3.000000e+00 | 32.94%
0.39/0.45 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.45 c 0.3s| 1 | 0 | 691 | - |1186k| 0 | 28 | 66 | 287 | 66 | 190 | 132 | 0 | 0 |-4.462321e+00 |-3.000000e+00 | 32.77%
0.39/0.47 c 0.4s| 1 | 0 | 741 | - |1217k| 0 | 32 | 66 | 287 | 66 | 195 | 137 | 0 | 0 |-4.458518e+00 |-3.000000e+00 | 32.71%
0.39/0.49 c 0.4s| 1 | 0 | 762 | - |1231k| 0 | 31 | 66 | 287 | 66 | 201 | 143 | 0 | 0 |-4.451613e+00 |-3.000000e+00 | 32.61%
0.49/0.51 c 0.4s| 1 | 0 | 876 | - |1299k| 0 | 33 | 66 | 287 | 66 | 205 | 147 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.49/0.53 c 0.4s| 1 | 0 | 892 | - |1323k| 0 | 36 | 66 | 287 | 66 | 139 | 156 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.49/0.55 c 0.5s| 1 | 0 | 915 | - |1358k| 0 | 38 | 66 | 287 | 66 | 145 | 162 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.49/0.57 c 0.5s| 1 | 0 | 941 | - |1431k| 0 | 38 | 66 | 287 | 66 | 150 | 167 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.49/0.58 c 0.5s| 1 | 0 | 968 | - |1450k| 0 | 37 | 66 | 287 | 66 | 157 | 174 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.60 c 0.5s| 1 | 0 | 997 | - |1460k| 0 | 36 | 66 | 287 | 66 | 162 | 179 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.69/0.74 c 0.6s| 1 | 0 | 1054 | - |1409k| 0 | 32 | 66 | 234 | 66 | 162 | 179 | 0 | 10 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.69/0.76 c 0.6s| 1 | 0 | 1084 | - |1414k| 0 | 32 | 66 | 234 | 66 | 136 | 187 | 0 | 10 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.79/0.82 c 0.7s| 1 | 2 | 1084 | - |1414k| 0 | 32 | 66 | 234 | 66 | 136 | 187 | 0 | 19 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.79/0.82 c (run 1, node 1) restarting after 14 global fixings of integer variables
0.79/0.82 c
0.79/0.82 c (restart) converted 22 cuts from the global cut pool into linear constraints
0.79/0.82 c
0.79/0.83 c presolving:
0.79/0.83 c (round 1) 14 del vars, 49 del conss, 0 chg bounds, 39 chg sides, 0 chg coeffs, 0 upgd conss, 2718 impls, 36 clqs
0.79/0.84 c (round 2) 14 del vars, 56 del conss, 0 chg bounds, 39 chg sides, 0 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.84 c (round 3) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 6 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.84 c (round 4) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 11 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.84 c (round 5) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 19 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.85 c (round 6) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 24 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.85 c (round 7) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 32 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.85 c (round 8) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 38 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.85 c (round 9) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 45 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.85 c (round 10) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 53 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.85 c (round 11) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 59 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.86 c (round 12) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 62 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.86 c (round 13) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 64 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.86 c (round 14) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 65 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.86 c (round 15) 14 del vars, 58 del conss, 0 chg bounds, 39 chg sides, 66 chg coeffs, 146 upgd conss, 2718 impls, 36 clqs
0.79/0.86 c presolving (16 rounds):
0.79/0.86 c 14 deleted vars, 58 deleted constraints, 0 tightened bounds, 0 added holes, 39 changed sides, 66 changed coefficients
0.79/0.86 c 2718 implications, 36 cliques
0.79/0.86 c presolved problem has 52 variables (52 bin, 0 int, 0 impl, 0 cont) and 198 constraints
0.79/0.86 c 3 constraints of type <knapsack>
0.79/0.86 c 35 constraints of type <setppc>
0.79/0.86 c 34 constraints of type <and>
0.79/0.86 c 1 constraints of type <linear>
0.79/0.86 c 125 constraints of type <logicor>
0.79/0.86 c transformed objective value is always integral (scale: 1)
0.79/0.86 c Presolving Time: 0.04
0.79/0.86 c
0.79/0.87 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.87 c 0.7s| 1 | 0 | 1135 | - | 600k| 0 | 30 | 52 | 198 | 52 | 115 | 0 | 0 | 19 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.79/0.88 c 0.8s| 1 | 0 | 1136 | - | 620k| 0 | 0 | 52 | 198 | 52 | 124 | 9 | 0 | 19 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.79/0.88 o -4
0.79/0.88 c * 0.8s| 1 | 0 | 1136 | - | 621k| 0 | - | 52 | 198 | 52 | 124 | 9 | 0 | 19 |-4.000000e+00 |-4.000000e+00 | 0.00%
0.79/0.88 c
0.79/0.88 c SCIP Status : problem is solved [optimal solution found]
0.79/0.88 c Solving Time (sec) : 0.75
0.79/0.88 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.79/0.88 c Primal Bound : -4.00000000000000e+00 (16 solutions)
0.79/0.88 c Dual Bound : -4.00000000000000e+00
0.79/0.88 c Gap : 0.00 %
0.79/0.88 s OPTIMUM FOUND
0.79/0.88 v x13 -x16 -x18 -x11 -x20 x19 x17 x15 -x14 -x12 x10 -x9 x8 -x7 x6 -x5 -x4 -x3 x2 -x1
0.79/0.88 c SCIP Status : problem is solved [optimal solution found]
0.79/0.88 c Solving Time : 0.75
0.79/0.88 c Original Problem :
0.79/0.88 c Problem name : HOME/instance-2666741-1276670867.opb
0.79/0.88 c Variables : 66 (66 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.88 c Constraints : 77 initial, 77 maximal
0.79/0.88 c Presolved Problem :
0.79/0.88 c Problem name : t_HOME/instance-2666741-1276670867.opb
0.79/0.88 c Variables : 52 (52 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.88 c Constraints : 198 initial, 198 maximal
0.79/0.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.88 c trivial : 0.00 14 0 0 0 0 0 0 0
0.79/0.88 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c probing : 0.01 0 0 0 0 0 0 0 0
0.79/0.88 c knapsack : 0.01 0 0 0 0 0 0 0 66
0.79/0.88 c setppc : 0.00 0 0 0 0 0 2 0 0
0.79/0.88 c and : 0.01 0 0 0 0 0 0 0 0
0.79/0.88 c linear : 0.00 0 0 0 0 0 47 39 0
0.79/0.88 c logicor : 0.00 0 0 0 0 0 9 0 0
0.79/0.88 c root node : - 14 - - 14 - - - -
0.79/0.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.88 c integral : 0 0 0 3 0 0 1 0 0 2
0.79/0.88 c knapsack : 3 1 1 0 0 0 0 0 0 0
0.79/0.88 c setppc : 35 23 240 1 0 0 0 0 0 0
0.79/0.88 c and : 34 23 240 1 0 0 6 31 0 0
0.79/0.88 c linear : 1 23 240 1 0 0 0 3 0 0
0.79/0.88 c logicor : 125 23 135 1 0 0 0 0 0 0
0.79/0.88 c countsols : 0 0 0 1 0 0 0 0 0 0
0.79/0.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.88 c integral : 0.21 0.00 0.00 0.21 0.00
0.79/0.88 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c setppc : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c and : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c linear : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c logicor : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c Propagators : Time Calls Cutoffs DomReds
0.79/0.88 c vbounds : 0.00 3 0 0
0.79/0.88 c rootredcost : 0.00 0 0 0
0.79/0.88 c pseudoobj : 0.00 35 0 0
0.79/0.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.88 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.88 c applied globally : - - - 0 0.0 - - -
0.79/0.88 c applied locally : - - - 0 0.0 - - -
0.79/0.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.88 c cut pool : 0.00 0 - - 0 - (maximal pool size: 20)
0.79/0.88 c redcost : 0.00 22 0 0 0 0
0.79/0.88 c impliedbounds : 0.00 22 0 0 139 0
0.79/0.88 c intobj : 0.00 0 0 0 0 0
0.79/0.88 c cgmip : 0.00 0 0 0 0 0
0.79/0.88 c gomory : 0.15 22 0 0 135 0
0.79/0.88 c strongcg : 0.07 21 0 0 1075 0
0.79/0.88 c cmir : 0.02 11 0 0 10 0
0.79/0.88 c flowcover : 0.05 11 0 0 28 0
0.79/0.88 c clique : 0.01 22 0 0 146 0
0.79/0.88 c zerohalf : 0.00 0 0 0 0 0
0.79/0.88 c mcf : 0.00 2 0 0 0 0
0.79/0.88 c rapidlearning : 0.06 1 0 7 0 280
0.79/0.88 c Pricers : Time Calls Vars
0.79/0.88 c problem variables: 0.00 0 0
0.79/0.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.88 c relpscost : 0.21 2 0 1 0 0 2
0.79/0.88 c pscost : 0.00 0 0 0 0 0 0
0.79/0.88 c inference : 0.00 0 0 0 0 0 0
0.79/0.88 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.88 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.88 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.88 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.88 c random : 0.00 0 0 0 0 0 0
0.79/0.88 c Primal Heuristics : Time Calls Found
0.79/0.88 c LP solutions : 0.00 - 1
0.79/0.88 c pseudo solutions : 0.00 - 0
0.79/0.88 c oneopt : 0.00 1 0
0.79/0.88 c trivial : 0.00 2 3
0.79/0.88 c simplerounding : 0.00 0 0
0.79/0.88 c zirounding : 0.00 1 0
0.79/0.88 c rounding : 0.00 24 0
0.79/0.88 c shifting : 0.01 24 10
0.79/0.88 c intshifting : 0.00 0 0
0.79/0.88 c twoopt : 0.00 0 0
0.79/0.88 c fixandinfer : 0.00 0 0
0.79/0.88 c feaspump : 0.00 0 0
0.79/0.88 c coefdiving : 0.00 0 0
0.79/0.88 c pscostdiving : 0.00 0 0
0.79/0.88 c fracdiving : 0.00 0 0
0.79/0.88 c veclendiving : 0.00 0 0
0.79/0.88 c intdiving : 0.00 0 0
0.79/0.88 c actconsdiving : 0.00 0 0
0.79/0.88 c objpscostdiving : 0.00 0 0
0.79/0.88 c rootsoldiving : 0.00 0 0
0.79/0.88 c linesearchdiving : 0.00 0 0
0.79/0.88 c guideddiving : 0.00 0 0
0.79/0.88 c octane : 0.00 0 0
0.79/0.88 c rens : 0.00 0 0
0.79/0.88 c rins : 0.00 0 0
0.79/0.88 c localbranching : 0.00 0 0
0.79/0.88 c mutation : 0.00 0 0
0.79/0.88 c crossover : 0.00 0 0
0.79/0.88 c dins : 0.00 0 0
0.79/0.88 c undercover : 0.04 1 1
0.79/0.88 c nlp : 0.00 0 0
0.79/0.88 c trysol : 0.00 0 0
0.79/0.88 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.88 c primal LP : 0.00 0 0 0.00 -
0.79/0.88 c dual LP : 0.07 26 1136 43.69 16228.57
0.79/0.88 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.88 c barrier LP : 0.00 0 0 0.00 -
0.79/0.88 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.88 c strong branching : 0.21 19 2497 131.42 11890.48
0.79/0.88 c (at root node) : - 19 2497 131.42 -
0.79/0.88 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.88 c B&B Tree :
0.79/0.88 c number of runs : 2
0.79/0.88 c nodes : 1
0.79/0.88 c nodes (total) : 2
0.79/0.88 c nodes left : 0
0.79/0.88 c max depth : 0
0.79/0.88 c max depth (total): 0
0.79/0.88 c backtracks : 0 (0.0%)
0.79/0.88 c delayed cutoffs : 0
0.79/0.88 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.88 c avg switch length: 2.00
0.79/0.88 c switching time : 0.00
0.79/0.88 c Solution :
0.79/0.88 c Solutions found : 16 (5 improvements)
0.79/0.88 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.79/0.88 c Primal Bound : -4.00000000000000e+00 (in run 2, after 1 nodes, 0.75 seconds, depth 0, found by <relaxation>)
0.79/0.88 c Dual Bound : -4.00000000000000e+00
0.79/0.88 c Gap : 0.00 %
0.79/0.88 c Root Dual Bound : -4.00000000000000e+00
0.79/0.88 c Root Iterations : 1136
0.79/0.89 c Time complete: 0.88.