0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703024-1278564402.opb>
0.00/0.01 c original problem has 80 variables (80 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 0 upgd conss, 244 impls, 0 clqs
0.00/0.02 c (round 2) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 3 upgd conss, 266 impls, 0 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 5 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 9 changed coefficients
0.00/0.02 c 308 implications, 0 cliques
0.00/0.02 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.02 c 49 constraints of type <and>
0.00/0.02 c 2 constraints of type <linear>
0.00/0.02 c 4 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1790
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c heuristics/undercover/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 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 0.0s| 1 | 0 | 14 | - | 415k| 0 | 8 | 75 | 55 | 75 | 101 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.03/0.05 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.03/0.05 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.03/0.05 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.03/0.08 o 9
0.03/0.08 c y 0.1s| 1 | 0 | 108 | - | 478k| 0 | 8 | 75 | 55 | 75 | 101 | 0 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.03/0.08 c 0.1s| 1 | 0 | 124 | - | 435k| 0 | 17 | 75 | 55 | 75 | 105 | 4 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.03/0.09 c 0.1s| 1 | 0 | 135 | - | 458k| 0 | 19 | 75 | 50 | 75 | 102 | 11 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.10/0.10 c 0.1s| 1 | 0 | 148 | - | 475k| 0 | 29 | 75 | 50 | 75 | 107 | 16 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.10/0.12 c 0.1s| 1 | 0 | 163 | - | 492k| 0 | 27 | 75 | 50 | 75 | 118 | 27 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.10/0.13 c 0.1s| 1 | 0 | 191 | - | 517k| 0 | 30 | 75 | 50 | 75 | 124 | 33 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.10/0.15 c 0.1s| 1 | 0 | 217 | - | 555k| 0 | 29 | 75 | 50 | 75 | 134 | 43 | 0 | 0 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.10/0.19 c 0.2s| 1 | 2 | 217 | - | 555k| 0 | 29 | 75 | 50 | 75 | 134 | 43 | 0 | 11 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.10/0.19 c (run 1, node 1) restarting after 7 global fixings of integer variables
0.10/0.19 c
0.10/0.19 c (restart) converted 28 cuts from the global cut pool into linear constraints
0.10/0.19 c
0.10/0.20 c presolving:
0.19/0.20 c (round 1) 7 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 24 upgd conss, 308 impls, 0 clqs
0.19/0.20 c presolving (2 rounds):
0.19/0.20 c 7 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.20 c 308 implications, 0 cliques
0.19/0.20 c presolved problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 74 constraints
0.19/0.20 c 6 constraints of type <knapsack>
0.19/0.20 c 14 constraints of type <setppc>
0.19/0.20 c 44 constraints of type <and>
0.19/0.20 c 2 constraints of type <linear>
0.19/0.20 c 8 constraints of type <logicor>
0.19/0.20 c transformed objective value is always integral (scale: 1)
0.19/0.20 c Presolving Time: 0.02
0.19/0.20 c
0.19/0.21 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.21 c 0.2s| 1 | 0 | 246 | - | 499k| 0 | 20 | 68 | 74 | 68 | 115 | 0 | 0 | 11 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.19/0.22 c 0.2s| 1 | 0 | 269 | - | 543k| 0 | 28 | 68 | 74 | 68 | 125 | 10 | 0 | 11 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.19/0.27 c 0.3s| 1 | 2 | 269 | - | 544k| 0 | 28 | 68 | 74 | 68 | 125 | 10 | 0 | 28 | 2.000000e+00 | 9.000000e+00 | 350.00%
0.49/0.53 o 2
0.49/0.53 c * 0.5s| 48 | 0 | 1045 | 16.5 | 548k| 14 | - | 68 | 100 | 68 | 55 | 233 | 26 | 306 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.49/0.53 c
0.49/0.53 c SCIP Status : problem is solved [optimal solution found]
0.49/0.53 c Solving Time (sec) : 0.52
0.49/0.53 c Solving Nodes : 48 (total of 49 nodes in 2 runs)
0.49/0.53 c Primal Bound : +2.00000000000000e+00 (2 solutions)
0.49/0.53 c Dual Bound : +2.00000000000000e+00
0.49/0.53 c Gap : 0.00 %
0.49/0.53 s OPTIMUM FOUND
0.49/0.53 v -x30 -x29 x28 x27 x26 -x25 -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.53 c SCIP Status : problem is solved [optimal solution found]
0.49/0.53 c Solving Time : 0.52
0.49/0.53 c Original Problem :
0.49/0.53 c Problem name : HOME/instance-2703024-1278564402.opb
0.49/0.53 c Variables : 80 (80 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 55 initial, 55 maximal
0.49/0.53 c Presolved Problem :
0.49/0.53 c Problem name : t_HOME/instance-2703024-1278564402.opb
0.49/0.53 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 74 initial, 100 maximal
0.49/0.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.53 c trivial : 0.00 7 0 0 0 0 0 0 0
0.49/0.53 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c implics : 0.00 0 2 0 0 0 0 0 0
0.49/0.53 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c setppc : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c and : 0.01 0 0 0 0 0 0 0 0
0.49/0.53 c linear : 0.00 1 2 0 0 0 4 0 9
0.49/0.53 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c root node : - 7 - - 7 - - - -
0.49/0.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.53 c integral : 0 0 0 45 0 0 10 0 0 78
0.49/0.53 c knapsack : 6 1 115 0 0 0 1 3 0 0
0.49/0.53 c setppc : 14 1 98 0 0 0 24 0 0 0
0.49/0.53 c and : 44 102 278 0 0 0 148 244 0 0
0.49/0.53 c linear : 2 7 277 0 0 10 72 0 0 0
0.49/0.53 c logicor : 8+ 7 91 0 0 0 3 0 0 0
0.49/0.53 c countsols : 0 0 0 1 0 0 0 0 0 0
0.49/0.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.53 c integral : 0.29 0.00 0.00 0.29 0.00
0.49/0.53 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c setppc : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c and : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c linear : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c Propagators : Time Calls Cutoffs DomReds
0.49/0.53 c vbounds : 0.00 3 0 0
0.49/0.53 c rootredcost : 0.00 0 0 0
0.49/0.53 c pseudoobj : 0.00 120 0 6
0.49/0.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.53 c propagation : 0.00 10 8 50 19.4 0 0.0 -
0.49/0.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.53 c applied globally : - - - 26 17.4 - - -
0.49/0.53 c applied locally : - - - 0 0.0 - - -
0.49/0.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.53 c cut pool : 0.00 0 - - 0 - (maximal pool size: 32)
0.49/0.53 c redcost : 0.00 103 0 2 0 0
0.49/0.53 c impliedbounds : 0.00 7 0 0 27 0
0.49/0.53 c intobj : 0.00 0 0 0 0 0
0.49/0.53 c cgmip : 0.00 0 0 0 0 0
0.49/0.53 c gomory : 0.02 7 0 0 42 0
0.49/0.53 c strongcg : 0.02 7 0 0 184 0
0.49/0.53 c cmir : 0.01 7 0 0 41 0
0.49/0.53 c flowcover : 0.02 7 0 0 100 0
0.49/0.53 c clique : 0.00 7 0 0 0 0
0.49/0.53 c zerohalf : 0.00 0 0 0 0 0
0.49/0.53 c mcf : 0.00 2 0 0 0 0
0.49/0.53 c rapidlearning : 0.03 1 0 0 0 0
0.49/0.53 c Pricers : Time Calls Vars
0.49/0.53 c problem variables: 0.00 0 0
0.49/0.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.53 c relpscost : 0.29 44 0 10 0 0 78
0.49/0.53 c pscost : 0.00 0 0 0 0 0 0
0.49/0.53 c inference : 0.00 0 0 0 0 0 0
0.49/0.53 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.53 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.53 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c random : 0.00 0 0 0 0 0 0
0.49/0.53 c Primal Heuristics : Time Calls Found
0.49/0.53 c LP solutions : 0.00 - 1
0.49/0.53 c pseudo solutions : 0.00 - 0
0.49/0.53 c crossover : 0.00 0 0
0.49/0.53 c coefdiving : 0.00 0 0
0.49/0.53 c pscostdiving : 0.00 0 0
0.49/0.53 c fracdiving : 0.00 0 0
0.49/0.53 c veclendiving : 0.00 0 0
0.49/0.53 c objpscostdiving : 0.00 0 0
0.49/0.53 c rootsoldiving : 0.00 0 0
0.49/0.53 c linesearchdiving : 0.00 0 0
0.49/0.53 c guideddiving : 0.00 0 0
0.49/0.53 c intshifting : 0.00 0 0
0.49/0.53 c oneopt : 0.00 1 0
0.49/0.53 c trivial : 0.00 2 0
0.49/0.53 c simplerounding : 0.00 0 0
0.49/0.53 c zirounding : 0.00 39 0
0.49/0.53 c rounding : 0.00 106 0
0.49/0.53 c shifting : 0.01 15 0
0.49/0.53 c twoopt : 0.00 0 0
0.49/0.53 c fixandinfer : 0.00 0 0
0.49/0.53 c feaspump : 0.00 1 0
0.49/0.53 c intdiving : 0.00 0 0
0.49/0.53 c actconsdiving : 0.00 0 0
0.49/0.53 c octane : 0.00 0 0
0.49/0.53 c rens : 0.01 1 0
0.49/0.53 c rins : 0.00 0 0
0.49/0.53 c localbranching : 0.00 0 0
0.49/0.53 c mutation : 0.00 0 0
0.49/0.53 c dins : 0.00 0 0
0.49/0.53 c undercover : 0.01 1 0
0.49/0.53 c nlp : 0.00 0 0
0.49/0.53 c trysol : 0.00 0 0
0.49/0.53 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.53 c primal LP : 0.00 0 0 0.00 -
0.49/0.53 c dual LP : 0.05 110 951 8.65 20674.81
0.49/0.53 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.53 c barrier LP : 0.00 0 0 0.00 -
0.49/0.53 c diving/probing LP: 0.00 11 94 8.55 -
0.49/0.53 c strong branching : 0.29 306 5591 18.27 19279.78
0.49/0.53 c (at root node) : - 28 1392 49.71 -
0.49/0.53 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.53 c B&B Tree :
0.49/0.53 c number of runs : 2
0.49/0.53 c nodes : 48
0.49/0.53 c nodes (total) : 49
0.49/0.53 c nodes left : 0
0.49/0.53 c max depth : 14
0.49/0.53 c max depth (total): 14
0.49/0.53 c backtracks : 4 (8.3%)
0.49/0.53 c delayed cutoffs : 2
0.49/0.53 c repropagations : 3 (14 domain reductions, 2 cutoffs)
0.49/0.53 c avg switch length: 2.00
0.49/0.53 c switching time : 0.00
0.49/0.53 c Solution :
0.49/0.53 c Solutions found : 2 (2 improvements)
0.49/0.53 c First Solution : +9.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <trysol>)
0.49/0.53 c Primal Bound : +2.00000000000000e+00 (in run 2, after 48 nodes, 0.52 seconds, depth 14, found by <relaxation>)
0.49/0.53 c Dual Bound : +2.00000000000000e+00
0.49/0.53 c Gap : 0.00 %
0.49/0.53 c Root Dual Bound : +2.00000000000000e+00
0.49/0.53 c Root Iterations : 269
0.49/0.54 c Time complete: 0.53.