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-2667454-1276354936.opb>
0.00/0.01 c original problem has 60 variables (60 bin, 0 int, 0 impl, 0 cont) and 30 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, 0 impls, 0 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 0 implications, 0 cliques
0.00/0.03 c presolved problem has 60 variables (60 bin, 0 int, 0 impl, 0 cont) and 30 constraints
0.00/0.03 c 30 constraints of type <knapsack>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
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 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.03 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.03 c t 0.0s| 1 | 0 | 71 | - | 632k| 0 | 8 | 60 | 30 | 60 | 30 | 0 | 0 | 0 |-7.839278e+03 | 0.000000e+00 | 100.00%
0.00/0.03 o -7534
0.00/0.03 c r 0.0s| 1 | 0 | 71 | - | 633k| 0 | 8 | 60 | 30 | 60 | 30 | 0 | 0 | 0 |-7.839278e+03 |-7.534000e+03 | 3.89%
0.00/0.03 o -7606
0.00/0.03 c R 0.0s| 1 | 0 | 71 | - | 634k| 0 | 8 | 60 | 30 | 60 | 30 | 0 | 0 | 0 |-7.839278e+03 |-7.606000e+03 | 2.98%
0.00/0.03 o -7629
0.00/0.03 c s 0.0s| 1 | 0 | 71 | - | 635k| 0 | 8 | 60 | 30 | 60 | 30 | 0 | 0 | 0 |-7.839278e+03 |-7.629000e+03 | 2.68%
0.29/0.36 c 0.3s| 1 | 0 | 76 | - |1225k| 0 | 10 | 60 | 341 | 60 | 38 | 8 | 0 | 0 |-7.831329e+03 |-7.629000e+03 | 2.58%
0.29/0.36 o -7772
0.29/0.36 c b 0.3s| 1 | 0 | 76 | - |1227k| 0 | 10 | 60 | 341 | 60 | 38 | 8 | 0 | 0 |-7.831329e+03 |-7.772000e+03 | 0.76%
0.29/0.39 c 0.3s| 1 | 0 | 84 | - |1060k| 0 | 12 | 60 | 189 | 60 | 45 | 15 | 0 | 0 |-7.828641e+03 |-7.772000e+03 | 0.72%
0.40/0.42 c 0.4s| 1 | 0 | 89 | - |1083k| 0 | 12 | 60 | 189 | 60 | 51 | 21 | 0 | 0 |-7.828237e+03 |-7.772000e+03 | 0.72%
0.40/0.46 c 0.4s| 1 | 0 | 97 | - |1103k| 0 | 15 | 60 | 189 | 60 | 56 | 26 | 0 | 0 |-7.826521e+03 |-7.772000e+03 | 0.70%
0.40/0.50 c 0.5s| 1 | 0 | 109 | - |1117k| 0 | 16 | 60 | 189 | 60 | 60 | 30 | 0 | 0 |-7.825413e+03 |-7.772000e+03 | 0.68%
0.49/0.54 c 0.5s| 1 | 0 | 115 | - |1140k| 0 | 17 | 60 | 189 | 60 | 65 | 35 | 0 | 0 |-7.824923e+03 |-7.772000e+03 | 0.68%
0.49/0.59 c 0.5s| 1 | 0 | 120 | - |1141k| 0 | 15 | 60 | 189 | 60 | 66 | 36 | 0 | 0 |-7.824666e+03 |-7.772000e+03 | 0.67%
0.59/0.63 c 0.6s| 1 | 0 | 125 | - |1144k| 0 | 17 | 60 | 189 | 60 | 68 | 38 | 0 | 0 |-7.824401e+03 |-7.772000e+03 | 0.67%
0.59/0.68 c 0.6s| 1 | 0 | 131 | - |1145k| 0 | 17 | 60 | 189 | 60 | 69 | 39 | 0 | 0 |-7.824329e+03 |-7.772000e+03 | 0.67%
0.69/0.73 c 0.7s| 1 | 0 | 133 | - |1146k| 0 | 18 | 60 | 189 | 60 | 70 | 40 | 0 | 0 |-7.824317e+03 |-7.772000e+03 | 0.67%
0.79/0.88 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.88 c 0.8s| 1 | 2 | 133 | - |1149k| 0 | 18 | 60 | 189 | 60 | 70 | 40 | 0 | 12 |-7.824317e+03 |-7.772000e+03 | 0.67%
0.79/0.88 c (run 1, node 1) restarting after 26 global fixings of integer variables
0.79/0.88 c
0.79/0.88 c (restart) converted 12 cuts from the global cut pool into linear constraints
0.79/0.88 c
0.79/0.88 c presolving:
0.79/0.88 c (round 1) 26 del vars, 0 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.79/0.89 c (round 2) 26 del vars, 13 del conss, 0 chg bounds, 13 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.79/0.89 c (round 3) 26 del vars, 13 del conss, 0 chg bounds, 13 chg sides, 0 chg coeffs, 158 upgd conss, 0 impls, 0 clqs
0.79/0.89 c presolving (4 rounds):
0.79/0.89 c 26 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 13 changed sides, 0 changed coefficients
0.79/0.89 c 0 implications, 0 cliques
0.79/0.89 c presolved problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 188 constraints
0.79/0.89 c 40 constraints of type <knapsack>
0.79/0.89 c 148 constraints of type <logicor>
0.79/0.89 c transformed objective value is always integral (scale: 1)
0.79/0.89 c Presolving Time: 0.02
0.79/0.89 c
0.79/0.90 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.90 c 0.8s| 1 | 0 | 206 | - | 807k| 0 | 16 | 34 | 188 | 34 | 42 | 0 | 0 | 12 |-7.824446e+03 |-7.772000e+03 | 0.67%
0.89/0.92 c 0.8s| 1 | 0 | 209 | - | 808k| 0 | 17 | 34 | 188 | 34 | 43 | 1 | 0 | 12 |-7.824388e+03 |-7.772000e+03 | 0.67%
0.89/0.94 c 0.9s| 1 | 2 | 209 | - | 810k| 0 | 17 | 34 | 188 | 34 | 43 | 1 | 0 | 29 |-7.824388e+03 |-7.772000e+03 | 0.67%
1.00/1.05 c
1.00/1.05 c SCIP Status : problem is solved [optimal solution found]
1.00/1.05 c Solving Time (sec) : 0.95
1.00/1.05 c Solving Nodes : 24 (total of 25 nodes in 2 runs)
1.00/1.05 c Primal Bound : -7.77200000000000e+03 (54 solutions)
1.00/1.05 c Dual Bound : -7.77200000000000e+03
1.00/1.05 c Gap : 0.00 %
1.00/1.05 s OPTIMUM FOUND
1.00/1.05 v -x57 x55 -x54 -x53 x52 -x51 -x50 x49 -x48 -x47 -x46 -x44 -x43 x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x33 -x32 x31 -x30 -x29 -x28
1.00/1.05 v -x27 -x26 -x25 x24 -x22 -x21 x20 -x19 x18 -x17 -x16 -x15 x14 -x13 x11 x10 -x9 x8 -x7 x6 x5 -x4 x3 -x2 x60 x59 -x58 -x56 x45
1.00/1.05 v -x34 -x23 x12 -x1
1.00/1.05 c SCIP Status : problem is solved [optimal solution found]
1.00/1.05 c Solving Time : 0.95
1.00/1.05 c Original Problem :
1.00/1.05 c Problem name : HOME/instance-2667454-1276354936.opb
1.00/1.05 c Variables : 60 (60 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.05 c Constraints : 30 initial, 30 maximal
1.00/1.05 c Presolved Problem :
1.00/1.05 c Problem name : t_HOME/instance-2667454-1276354936.opb
1.00/1.05 c Variables : 34 (34 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.05 c Constraints : 188 initial, 196 maximal
1.00/1.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.00/1.05 c trivial : 0.00 26 0 0 0 0 0 0 0
1.00/1.05 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c implics : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c probing : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c linear : 0.01 0 0 0 0 0 13 13 0
1.00/1.05 c logicor : 0.00 0 0 0 0 0 0 0 0
1.00/1.05 c root node : - 58 - - 58 - - - -
1.00/1.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.00/1.05 c integral : 0 0 0 31 0 2 28 0 0 26
1.00/1.05 c knapsack : 40 12 220 0 0 5 60 93 0 0
1.00/1.05 c logicor : 148+ 1 27 0 0 0 4 0 0 0
1.00/1.05 c countsols : 0 0 0 0 0 0 0 0 0 0
1.00/1.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.00/1.05 c integral : 0.10 0.00 0.00 0.10 0.00
1.00/1.05 c knapsack : 0.04 0.02 0.02 0.00 0.00
1.00/1.05 c logicor : 0.00 0.00 0.00 0.00 0.00
1.00/1.05 c countsols : 0.00 0.00 0.00 0.00 0.00
1.00/1.05 c Propagators : Time Calls Cutoffs DomReds
1.00/1.05 c vbounds : 0.00 3 0 0
1.00/1.05 c rootredcost : 0.00 0 0 0
1.00/1.05 c pseudoobj : 0.00 127 5 22
1.00/1.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.05 c propagation : 0.00 9 7 14 15.1 0 0.0 -
1.00/1.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.05 c applied globally : - - - 8 13.8 - - -
1.00/1.05 c applied locally : - - - 0 0.0 - - -
1.00/1.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.00/1.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.00/1.05 c redcost : 0.00 55 0 89 0 0
1.00/1.05 c impliedbounds : 0.00 12 0 0 0 0
1.00/1.05 c intobj : 0.00 0 0 0 0 0
1.00/1.05 c cgmip : 0.00 0 0 0 0 0
1.00/1.05 c gomory : 0.04 12 0 0 0 0
1.00/1.05 c strongcg : 0.00 12 0 0 0 0
1.00/1.05 c cmir : 0.08 11 0 0 44 0
1.00/1.05 c flowcover : 0.26 11 0 0 73 0
1.00/1.05 c clique : 0.00 2 0 0 0 0
1.00/1.05 c zerohalf : 0.00 0 0 0 0 0
1.00/1.05 c mcf : 0.00 2 0 0 0 0
1.00/1.05 c rapidlearning : 0.28 1 0 0 0 311
1.00/1.05 c Pricers : Time Calls Vars
1.00/1.05 c problem variables: 0.00 0 0
1.00/1.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.00/1.05 c relpscost : 0.10 31 2 28 0 0 26
1.00/1.05 c pscost : 0.00 0 0 0 0 0 0
1.00/1.05 c inference : 0.00 0 0 0 0 0 0
1.00/1.05 c mostinf : 0.00 0 0 0 0 0 0
1.00/1.05 c leastinf : 0.00 0 0 0 0 0 0
1.00/1.05 c fullstrong : 0.00 0 0 0 0 0 0
1.00/1.05 c allfullstrong : 0.00 0 0 0 0 0 0
1.00/1.05 c random : 0.00 0 0 0 0 0 0
1.00/1.05 c Primal Heuristics : Time Calls Found
1.00/1.05 c LP solutions : 0.00 - 0
1.00/1.05 c pseudo solutions : 0.00 - 0
1.00/1.05 c crossover : 0.00 0 0
1.00/1.05 c coefdiving : 0.00 0 0
1.00/1.05 c pscostdiving : 0.00 0 0
1.00/1.05 c fracdiving : 0.00 0 0
1.00/1.05 c veclendiving : 0.00 0 0
1.00/1.05 c objpscostdiving : 0.00 0 0
1.00/1.05 c rootsoldiving : 0.00 0 0
1.00/1.05 c linesearchdiving : 0.00 0 0
1.00/1.05 c guideddiving : 0.00 0 0
1.00/1.05 c oneopt : 0.00 2 1
1.00/1.05 c trivial : 0.00 2 3
1.00/1.05 c simplerounding : 0.00 46 28
1.00/1.05 c zirounding : 0.00 15 11
1.00/1.05 c rounding : 0.01 46 1
1.00/1.05 c shifting : 0.01 13 8
1.00/1.05 c intshifting : 0.00 0 0
1.00/1.05 c twoopt : 0.00 0 0
1.00/1.05 c fixandinfer : 0.00 0 0
1.00/1.05 c feaspump : 0.00 0 0
1.00/1.05 c intdiving : 0.00 0 0
1.00/1.05 c actconsdiving : 0.00 0 0
1.00/1.05 c octane : 0.00 0 0
1.00/1.05 c rens : 0.08 1 1
1.00/1.05 c rins : 0.00 0 0
1.00/1.05 c localbranching : 0.00 0 0
1.00/1.05 c mutation : 0.00 0 0
1.00/1.05 c dins : 0.00 0 0
1.00/1.05 c undercover : 0.00 0 0
1.00/1.05 c nlp : 0.00 0 0
1.00/1.05 c trysol : 0.00 0 0
1.00/1.05 c LP : Time Calls Iterations Iter/call Iter/sec
1.00/1.05 c primal LP : 0.00 0 0 0.00 -
1.00/1.05 c dual LP : 0.01 47 466 9.91 46600.00
1.00/1.05 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.05 c barrier LP : 0.00 0 0 0.00 -
1.00/1.05 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.05 c strong branching : 0.10 139 2396 17.24 23960.00
1.00/1.05 c (at root node) : - 29 807 27.83 -
1.00/1.05 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.05 c B&B Tree :
1.00/1.05 c number of runs : 2
1.00/1.05 c nodes : 24
1.00/1.05 c nodes (total) : 25
1.00/1.05 c nodes left : 0
1.00/1.05 c max depth : 7
1.00/1.05 c max depth (total): 7
1.00/1.05 c backtracks : 4 (16.7%)
1.00/1.05 c delayed cutoffs : 1
1.00/1.05 c repropagations : 16 (9 domain reductions, 1 cutoffs)
1.00/1.05 c avg switch length: 4.25
1.00/1.05 c switching time : 0.00
1.00/1.05 c Solution :
1.00/1.05 c Solutions found : 54 (5 improvements)
1.00/1.05 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.00/1.05 c Primal Bound : -7.77200000000000e+03 (in run 1, after 1 nodes, 0.32 seconds, depth 0, found by <oneopt>)
1.00/1.05 c Dual Bound : -7.77200000000000e+03
1.00/1.05 c Gap : 0.00 %
1.00/1.05 c Root Dual Bound : -7.82438778363508e+03
1.00/1.05 c Root Iterations : 209
1.00/1.05 c Time complete: 1.05.