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-3731227-1338695244.opb>
0.00/0.00 c original problem has 9 variables (9 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 9
0.00/0.01 c feasible solution found by trivial heuristic, objective value 9.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 9 variables (9 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 12 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.5
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c t 0.0s| 1 | 0 | 10 | - | 155k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 9.000000e+00 | 125.00%
0.00/0.01 o 7
0.00/0.01 c r 0.0s| 1 | 0 | 10 | - | 155k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 7.000000e+00 | 75.00%
0.00/0.01 o 6
0.00/0.01 c R 0.0s| 1 | 0 | 10 | - | 155k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 6.000000e+00 | 50.00%
0.00/0.01 o 5
0.00/0.01 c s 0.0s| 1 | 0 | 10 | - | 156k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 12 | - | 157k| 0 | 6 | 9 | 13 | 9 | 14 | 1 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 14 | - | 160k| 0 | 6 | 9 | 13 | 9 | 15 | 2 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 15 | - | 165k| 0 | 6 | 9 | 13 | 9 | 16 | 3 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 17 | - | 166k| 0 | 6 | 9 | 13 | 9 | 17 | 4 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.03 c 0.0s| 1 | 0 | 19 | - | 171k| 0 | 8 | 9 | 13 | 9 | 18 | 5 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.03 c 0.0s| 1 | 0 | 23 | - | 179k| 0 | 6 | 9 | 13 | 9 | 19 | 6 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.03 c 0.0s| 1 | 0 | 23 | - | 180k| 0 | - | 9 | 13 | 9 | 19 | 6 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.03 c (run 1, node 1) restarting after 2 global fixings of integer variables
0.00/0.03 c
0.00/0.03 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.00/0.03 c
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 3 del vars, 3 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 12 impls, 0 clqs
0.00/0.04 c (round 2) 3 del vars, 6 del conss, 3 add conss, 0 chg bounds, 4 chg sides, 7 chg coeffs, 4 upgd conss, 12 impls, 0 clqs
0.00/0.04 c (round 3) 3 del vars, 19 del conss, 15 add conss, 0 chg bounds, 16 chg sides, 31 chg coeffs, 5 upgd conss, 12 impls, 0 clqs
0.00/0.04 c (round 4) 3 del vars, 23 del conss, 18 add conss, 0 chg bounds, 19 chg sides, 37 chg coeffs, 5 upgd conss, 12 impls, 0 clqs
0.00/0.04 c presolving (5 rounds):
0.00/0.04 c 3 deleted vars, 23 deleted constraints, 18 added constraints, 0 tightened bounds, 0 added holes, 19 changed sides, 37 changed coefficients
0.00/0.04 c 12 implications, 0 cliques
0.00/0.04 c presolved problem has 6 variables (6 bin, 0 int, 0 impl, 0 cont) and 14 constraints
0.00/0.04 c 6 constraints of type <setppc>
0.00/0.04 c 8 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.00
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 0.0s| 1 | 0 | 29 | - | 161k| 0 | 6 | 6 | 14 | 6 | 14 | 0 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.04 o 5
0.00/0.04 c s 0.0s| 1 | 0 | 29 | - | 161k| 0 | 6 | 6 | 14 | 6 | 14 | 0 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.04 c 0.0s| 1 | 0 | 32 | - | 162k| 0 | - | 6 | 14 | 6 | 15 | 1 | 0 | 6 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.00/0.04 c 0.0s| 1 | 0 | 32 | - | 162k| 0 | - | 6 | 14 | 6 | 15 | 1 | 0 | 6 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.03
0.00/0.04 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.00/0.04 c Primal Bound : +5.00000000000000e+00 (19 solutions)
0.00/0.04 c Dual Bound : +5.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v x9 -x8 x7 -x6 x5 x4 -x3 x2 -x1
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.03
0.00/0.04 c solving : 0.03
0.00/0.04 c presolving : 0.00 (included in solving)
0.00/0.04 c reading : 0.00 (included in solving)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-3731227-1338695244.opb
0.00/0.04 c Variables : 9 (9 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 13 initial, 13 maximal
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-3731227-1338695244.opb
0.00/0.04 c Variables : 6 (6 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 14 initial, 14 maximal
0.00/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c trivial : 0.00 2 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c knapsack : 0.00 0 0 0 0 0 6 18 18 36
0.00/0.04 c setppc : 0.00 0 0 0 0 0 12 0 0 0
0.00/0.04 c linear : 0.00 0 0 0 0 0 1 0 1 1
0.00/0.04 c logicor : 0.00 1 0 0 0 0 4 0 0 0
0.00/0.04 c root node : - 2 - - 2 - - - - -
0.00/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 1 0 25 0 0 2 0 0 0
0.00/0.04 c setppc : 6 1 1 0 0 2 0 0 0 0 0 0
0.00/0.04 c logicor : 8 7 10 0 0 18 0 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 22 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c pseudoobj : 4 0 0 0
0.00/0.04 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.04 c vbounds : 0.00 0.00 0.00
0.00/0.04 c rootredcost : 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 0 0.0 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 2)
0.00/0.04 c redcost : 0.00 7 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 7 0 0 0 0
0.00/0.04 c intobj : 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 7 0 0 53 0
0.00/0.04 c cgmip : 0.00 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 7 0 0 53 0
0.00/0.04 c cmir : 0.00 7 0 0 0 0
0.00/0.04 c flowcover : 0.00 7 0 0 0 0
0.00/0.04 c clique : 0.00 2 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 2 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.02 1 0 0 0 0
0.00/0.04 c Pricers : Time Calls Vars
0.00/0.04 c problem variables: 0.00 0 0
0.00/0.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c relpscost : 0.00 1 0 2 0 0 0
0.00/0.04 c pscost : 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : Time Calls Found
0.00/0.04 c LP solutions : 0.00 - 0
0.00/0.04 c pseudo solutions : 0.00 - 0
0.00/0.04 c oneopt : 0.00 1 0
0.00/0.04 c trivial : 0.00 2 1
0.00/0.04 c shiftandpropagate: 0.00 0 0
0.00/0.04 c simplerounding : 0.00 8 8
0.00/0.04 c zirounding : 0.00 1 1
0.00/0.04 c rounding : 0.00 8 1
0.00/0.04 c shifting : 0.00 8 8
0.00/0.04 c intshifting : 0.00 0 0
0.00/0.04 c twoopt : 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0 0
0.00/0.04 c feaspump : 0.00 0 0
0.00/0.04 c clique : 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0 0
0.00/0.04 c intdiving : 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0 0
0.00/0.04 c octane : 0.00 0 0
0.00/0.04 c rens : 0.01 0 0
0.00/0.04 c rins : 0.00 0 0
0.00/0.04 c localbranching : 0.00 0 0
0.00/0.04 c mutation : 0.00 0 0
0.00/0.04 c crossover : 0.00 0 0
0.00/0.04 c dins : 0.00 0 0
0.00/0.04 c vbounds : 0.00 0 0
0.00/0.04 c undercover : 0.00 0 0
0.00/0.04 c subnlp : 0.00 0 0
0.00/0.04 c trysol : 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.04 c primal LP : 0.00 0 0 0.00 -
0.00/0.04 c dual LP : 0.00 9 32 3.56 -
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 -
0.00/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.04 c strong branching : 0.00 6 46 7.67 -
0.00/0.04 c (at root node) : - 6 46 7.67 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 2
0.00/0.04 c nodes : 1
0.00/0.04 c nodes (total) : 2
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 19 (5 improvements)
0.00/0.04 c First Solution : +9.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.04 c Primal Bound : +5.00000000000000e+00 (in run 2, after 1 nodes, 0.03 seconds, depth 0, found by <shifting>)
0.00/0.04 c Dual Bound : +5.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +5.00000000000000e+00
0.00/0.04 c Root Iterations : 32
0.00/0.04 c Time complete: 0.03.