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-2704305-1278551732.opb>
0.00/0.01 c original problem has 33 variables (33 bin, 0 int, 0 impl, 0 cont) and 15 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.01 c (round 1) 2 del vars, 1 del conss, 0 chg bounds, 5 chg sides, 13 chg coeffs, 0 upgd conss, 4 impls, 3 clqs
0.00/0.02 c (round 2) 3 del vars, 2 del conss, 0 chg bounds, 5 chg sides, 13 chg coeffs, 11 upgd conss, 4 impls, 3 clqs
0.00/0.02 c (round 3) 3 del vars, 2 del conss, 0 chg bounds, 5 chg sides, 13 chg coeffs, 12 upgd conss, 4 impls, 3 clqs
0.00/0.02 c presolving (4 rounds):
0.00/0.02 c 3 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 13 changed coefficients
0.00/0.02 c 4 implications, 3 cliques
0.00/0.02 c presolved problem has 30 variables (30 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.02 c 5 constraints of type <knapsack>
0.00/0.02 c 4 constraints of type <setppc>
0.00/0.02 c 1 constraints of type <linear>
0.00/0.02 c 3 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 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 | 32 | - | 214k| 0 | 7 | 30 | 13 | 30 | 13 | 0 | 0 | 0 | 2.839492e+03 | -- | Inf
0.09/0.10 o 3095
0.09/0.10 c y 0.1s| 1 | 0 | 57 | - | 230k| 0 | 7 | 30 | 13 | 30 | 13 | 0 | 0 | 0 | 2.839492e+03 | 3.095000e+03 | 9.00%
0.09/0.11 c 0.1s| 1 | 0 | 69 | - | 448k| 0 | 5 | 30 | 199 | 30 | 17 | 6 | 0 | 0 | 3.043025e+03 | 3.095000e+03 | 1.71%
0.09/0.12 c 0.1s| 1 | 0 | 75 | - | 337k| 0 | 6 | 30 | 37 | 30 | 20 | 11 | 0 | 0 | 3.045275e+03 | 3.095000e+03 | 1.63%
0.09/0.12 o 3089
0.09/0.12 c s 0.1s| 1 | 0 | 75 | - | 338k| 0 | 6 | 30 | 37 | 30 | 20 | 11 | 0 | 0 | 3.045275e+03 | 3.089000e+03 | 1.44%
0.09/0.12 c 0.1s| 1 | 0 | 87 | - | 350k| 0 | 3 | 30 | 37 | 30 | 25 | 16 | 0 | 0 | 3.062500e+03 | 3.089000e+03 | 0.87%
0.09/0.12 c 0.1s| 1 | 0 | 92 | - | 335k| 0 | - | 30 | 6 | 30 | 21 | 18 | 0 | 0 | 3.089000e+03 | 3.089000e+03 | 0.00%
0.09/0.12 c 0.1s| 1 | 0 | 92 | - | 335k| 0 | - | 30 | 6 | 30 | 21 | 18 | 0 | 0 | 3.089000e+03 | 3.089000e+03 | 0.00%
0.09/0.12 c
0.09/0.12 c SCIP Status : problem is solved [optimal solution found]
0.09/0.12 c Solving Time (sec) : 0.11
0.09/0.12 c Solving Nodes : 1
0.09/0.12 c Primal Bound : +3.08900000000000e+03 (3 solutions)
0.09/0.12 c Dual Bound : +3.08900000000000e+03
0.09/0.12 c Gap : 0.00 %
0.09/0.12 s OPTIMUM FOUND
0.09/0.12 v -x33 -x32 -x31 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
0.09/0.12 v -x3 -x2 x1
0.09/0.12 c SCIP Status : problem is solved [optimal solution found]
0.09/0.12 c Solving Time : 0.11
0.09/0.12 c Original Problem :
0.09/0.12 c Problem name : HOME/instance-2704305-1278551732.opb
0.09/0.12 c Variables : 33 (33 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.12 c Constraints : 15 initial, 15 maximal
0.09/0.12 c Presolved Problem :
0.09/0.12 c Problem name : t_HOME/instance-2704305-1278551732.opb
0.09/0.12 c Variables : 30 (30 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.12 c Constraints : 13 initial, 305 maximal
0.09/0.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.12 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.09/0.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c probing : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c setppc : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c linear : 0.00 0 1 0 0 0 2 5 13
0.09/0.12 c logicor : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c root node : - 22 - - 22 - - - -
0.09/0.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.12 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.12 c knapsack : 5 5 67 0 0 0 2 30 0 0
0.09/0.12 c setppc : 4 5 65 0 0 0 5 0 0 0
0.09/0.12 c linear : 1+ 5 67 0 0 0 2 17 0 0
0.09/0.12 c logicor : 3 5 9 0 0 0 1 0 0 0
0.09/0.12 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.12 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c setppc : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c linear : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c Propagators : Time Calls Cutoffs DomReds
0.09/0.12 c vbounds : 0.00 2 0 0
0.09/0.12 c rootredcost : 0.00 0 0 0
0.09/0.12 c pseudoobj : 0.00 12 1 0
0.09/0.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.12 c applied globally : - - - 0 0.0 - - -
0.09/0.12 c applied locally : - - - 0 0.0 - - -
0.09/0.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.12 c cut pool : 0.00 3 - - 15 - (maximal pool size: 65)
0.09/0.12 c redcost : 0.00 4 0 8 0 0
0.09/0.12 c impliedbounds : 0.00 4 0 0 0 0
0.09/0.12 c intobj : 0.00 0 0 0 0 0
0.09/0.12 c cgmip : 0.00 0 0 0 0 0
0.09/0.12 c gomory : 0.00 4 0 0 25 0
0.09/0.12 c strongcg : 0.00 4 0 0 21 0
0.09/0.12 c cmir : 0.00 4 0 0 16 0
0.09/0.12 c flowcover : 0.00 4 0 0 32 0
0.09/0.12 c clique : 0.00 4 0 0 0 0
0.09/0.12 c zerohalf : 0.00 0 0 0 0 0
0.09/0.12 c mcf : 0.00 1 0 0 0 0
0.09/0.12 c rapidlearning : 0.08 1 0 4 0 292
0.09/0.12 c Pricers : Time Calls Vars
0.09/0.12 c problem variables: 0.00 0 0
0.09/0.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.12 c pscost : 0.00 0 0 0 0 0 0
0.09/0.12 c inference : 0.00 0 0 0 0 0 0
0.09/0.12 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.12 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.12 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.12 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.12 c random : 0.00 0 0 0 0 0 0
0.09/0.12 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.12 c Primal Heuristics : Time Calls Found
0.09/0.12 c LP solutions : 0.00 - 0
0.09/0.12 c pseudo solutions : 0.00 - 0
0.09/0.12 c oneopt : 0.00 2 0
0.09/0.12 c trivial : 0.00 2 0
0.09/0.12 c simplerounding : 0.00 4 0
0.09/0.12 c zirounding : 0.00 0 0
0.09/0.12 c rounding : 0.00 4 0
0.09/0.12 c shifting : 0.00 4 2
0.09/0.12 c intshifting : 0.00 0 0
0.09/0.12 c twoopt : 0.00 0 0
0.09/0.12 c fixandinfer : 0.00 0 0
0.09/0.12 c feaspump : 0.00 1 0
0.09/0.12 c coefdiving : 0.00 0 0
0.09/0.12 c pscostdiving : 0.00 0 0
0.09/0.12 c fracdiving : 0.00 0 0
0.09/0.12 c veclendiving : 0.00 0 0
0.09/0.12 c intdiving : 0.00 0 0
0.09/0.12 c actconsdiving : 0.00 0 0
0.09/0.12 c objpscostdiving : 0.00 0 0
0.09/0.12 c rootsoldiving : 0.00 0 0
0.09/0.12 c linesearchdiving : 0.00 0 0
0.09/0.12 c guideddiving : 0.00 0 0
0.09/0.12 c octane : 0.00 0 0
0.09/0.12 c rens : 0.00 0 0
0.09/0.12 c rins : 0.00 0 0
0.09/0.12 c localbranching : 0.00 0 0
0.09/0.12 c mutation : 0.00 0 0
0.09/0.12 c crossover : 0.00 0 0
0.09/0.12 c dins : 0.00 0 0
0.09/0.12 c undercover : 0.00 0 0
0.09/0.12 c nlp : 0.00 0 0
0.09/0.12 c trysol : 0.00 0 0
0.09/0.12 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.12 c primal LP : 0.00 0 0 0.00 -
0.09/0.12 c dual LP : 0.00 6 67 11.17 -
0.09/0.12 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.12 c barrier LP : 0.00 0 0 0.00 -
0.09/0.12 c diving/probing LP: 0.00 10 25 2.50 -
0.09/0.12 c strong branching : 0.00 0 0 0.00 -
0.09/0.12 c (at root node) : - 0 0 0.00 -
0.09/0.12 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.12 c B&B Tree :
0.09/0.12 c number of runs : 1
0.09/0.12 c nodes : 1
0.09/0.12 c nodes (total) : 1
0.09/0.12 c nodes left : 0
0.09/0.12 c max depth : 0
0.09/0.12 c max depth (total): 0
0.09/0.12 c backtracks : 0 (0.0%)
0.09/0.12 c delayed cutoffs : 0
0.09/0.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.12 c avg switch length: 2.00
0.09/0.12 c switching time : 0.00
0.09/0.12 c Solution :
0.09/0.12 c Solutions found : 3 (2 improvements)
0.09/0.12 c First Solution : +3.09500000000000e+03 (in run 1, after 1 nodes, 0.09 seconds, depth 0, found by <trysol>)
0.09/0.12 c Primal Bound : +3.08900000000000e+03 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by <shifting>)
0.09/0.12 c Dual Bound : +3.08900000000000e+03
0.09/0.12 c Gap : 0.00 %
0.09/0.12 c Root Dual Bound : +3.08900000000000e+03
0.09/0.12 c Root Iterations : 92
0.09/0.13 c Time complete: 0.12.