0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666030-1276356076.opb>
0.00/0.01 c original problem has 40 variables (40 bin, 0 int, 0 impl, 0 cont) and 23 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) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 0 upgd conss, 0 impls, 10 clqs
0.00/0.01 c (round 2) 0 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 3 upgd conss, 0 impls, 10 clqs
0.00/0.02 c (round 3) 0 del vars, 10 del conss, 0 chg bounds, 1 chg sides, 20 chg coeffs, 13 upgd conss, 0 impls, 10 clqs
0.00/0.02 c presolving (4 rounds):
0.00/0.02 c 0 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 20 changed coefficients
0.00/0.02 c 0 implications, 10 cliques
0.00/0.02 c presolved problem has 40 variables (40 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.02 c 3 constraints of type <knapsack>
0.00/0.02 c 10 constraints of type <setppc>
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.2
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 = 1800
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 # 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 # 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 | 15 | - | 241k| 0 | 2 | 40 | 13 | 40 | 13 | 0 | 0 | 0 | 6.182908e+04 | -- | Inf
0.00/0.03 o 62076
0.00/0.03 c s 0.0s| 1 | 0 | 15 | - | 242k| 0 | 2 | 40 | 13 | 40 | 13 | 0 | 0 | 0 | 6.182908e+04 | 6.207600e+04 | 0.40%
0.00/0.10 c 0.1s| 1 | 0 | 18 | - | 454k| 0 | 0 | 40 | 252 | 40 | 14 | 1 | 0 | 0 | 6.202700e+04 | 6.207600e+04 | 0.08%
0.00/0.10 c 0.1s| 1 | 0 | 18 | - | 297k| 0 | 0 | 40 | 8 | 40 | 13 | 1 | 0 | 0 | 6.202700e+04 | 6.207600e+04 | 0.08%
0.00/0.10 c (run 1, node 1) restarting after 28 global fixings of integer variables
0.00/0.10 c
0.00/0.10 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.00/0.10 c
0.00/0.10 c presolving:
0.10/0.10 c (round 1) 31 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 3 chg coeffs, 1 upgd conss, 0 impls, 2 clqs
0.10/0.11 c (round 2) 31 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 9 chg coeffs, 1 upgd conss, 0 impls, 2 clqs
0.10/0.11 c presolving (3 rounds):
0.10/0.11 c 31 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 9 changed coefficients
0.10/0.11 c 0 implications, 2 cliques
0.10/0.11 c presolved problem has 9 variables (9 bin, 0 int, 0 impl, 0 cont) and 4 constraints
0.10/0.11 c 2 constraints of type <knapsack>
0.10/0.11 c 2 constraints of type <setppc>
0.10/0.11 c transformed objective value is always integral (scale: 1)
0.10/0.11 c Presolving Time: 0.01
0.10/0.11 c
0.10/0.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.11 c 0.1s| 1 | 0 | 22 | - | 274k| 0 | 0 | 9 | 4 | 9 | 4 | 0 | 0 | 0 | 6.202700e+04 | 6.207600e+04 | 0.08%
0.10/0.11 c 0.1s| 1 | 0 | 22 | - | 273k| 0 | 0 | 9 | 2 | 9 | 4 | 0 | 0 | 0 | 6.202700e+04 | 6.207600e+04 | 0.08%
0.10/0.11 c (run 2, node 1) restarting after 5 global fixings of integer variables
0.10/0.11 c
0.10/0.11 c presolving:
0.10/0.11 c (round 1) 6 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.10/0.12 c (round 2) 6 del vars, 2 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.10/0.12 c presolving (3 rounds):
0.10/0.12 c 9 deleted vars, 2 deleted constraints, 3 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.12 c 0 implications, 0 cliques
0.10/0.12 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.10/0.12 c transformed objective value is always integral (scale: 1)
0.10/0.12 c Presolving Time: 0.01
0.10/0.12 c
0.10/0.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.12 c 0.1s| 1 | 0 | 22 | - | 268k| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 6.202700e+04 | 6.207600e+04 | 0.08%
0.10/0.12 o 62027
0.10/0.12 c * 0.1s| 1 | 0 | 22 | - | 268k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 6.202700e+04 | 6.202700e+04 | 0.00%
0.10/0.12 c
0.10/0.12 c SCIP Status : problem is solved [optimal solution found]
0.10/0.12 c Solving Time (sec) : 0.06
0.10/0.12 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.10/0.12 c Primal Bound : +6.20270000000000e+04 (2 solutions)
0.10/0.12 c Dual Bound : +6.20270000000000e+04
0.10/0.12 c Gap : 0.00 %
0.10/0.12 s OPTIMUM FOUND
0.10/0.12 v -x40 -x39 x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30 x29 -x28 -x27 x26 -x25 -x24 -x23 x22 -x21 -x20 -x19 x18 -x17 -x16 x15 -x14
0.10/0.12 v -x13 -x12 -x11 -x10 x9 -x8 -x7 x6 -x5 -x4 -x3 x2 -x1
0.10/0.12 c SCIP Status : problem is solved [optimal solution found]
0.10/0.12 c Solving Time : 0.06
0.10/0.12 c Original Problem :
0.10/0.12 c Problem name : HOME/instance-2666030-1276356076.opb
0.10/0.12 c Variables : 40 (40 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.12 c Constraints : 23 initial, 23 maximal
0.10/0.12 c Presolved Problem :
0.10/0.12 c Problem name : t_HOME/instance-2666030-1276356076.opb
0.10/0.12 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.12 c Constraints : 0 initial, 0 maximal
0.10/0.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.10/0.12 c trivial : 0.00 36 0 0 0 0 0 0 0
0.10/0.12 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.10/0.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.10/0.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.10/0.12 c implics : 0.00 0 0 0 0 0 0 0 0
0.10/0.12 c probing : 0.00 0 0 0 0 0 0 0 0
0.10/0.12 c knapsack : 0.00 0 0 0 3 0 3 6 19
0.10/0.12 c setppc : 0.00 0 4 0 0 0 4 0 0
0.10/0.12 c linear : 0.00 0 0 0 0 0 10 0 10
0.10/0.12 c root node : - 33 - - 33 - - - -
0.10/0.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.10/0.12 c integral : 0 0 0 3 0 0 0 0 0 0
0.10/0.12 c countsols : 0 0 0 3 0 0 0 0 0 0
0.10/0.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.10/0.12 c integral : 0.00 0.00 0.00 0.00 0.00
0.10/0.12 c countsols : 0.00 0.00 0.00 0.00 0.00
0.10/0.12 c Propagators : Time Calls Cutoffs DomReds
0.10/0.12 c vbounds : 0.00 4 0 0
0.10/0.12 c rootredcost : 0.00 0 0 0
0.10/0.12 c pseudoobj : 0.00 10 0 0
0.10/0.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.10/0.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.12 c applied globally : - - - 0 0.0 - - -
0.10/0.12 c applied locally : - - - 0 0.0 - - -
0.10/0.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.10/0.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.10/0.12 c redcost : 0.01 4 0 24 0 0
0.10/0.12 c impliedbounds : 0.00 1 0 0 0 0
0.10/0.12 c intobj : 0.00 0 0 0 0 0
0.10/0.12 c cgmip : 0.00 0 0 0 0 0
0.10/0.12 c gomory : 0.00 1 0 0 2 0
0.10/0.12 c strongcg : 0.00 1 0 0 1 0
0.10/0.12 c cmir : 0.00 1 0 0 1 0
0.10/0.12 c flowcover : 0.00 1 0 0 2 0
0.10/0.12 c clique : 0.00 1 0 0 0 0
0.10/0.12 c zerohalf : 0.00 0 0 0 0 0
0.10/0.12 c mcf : 0.00 1 0 0 0 0
0.10/0.12 c rapidlearning : 0.04 1 0 1 0 240
0.10/0.12 c Pricers : Time Calls Vars
0.10/0.12 c problem variables: 0.00 0 0
0.10/0.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.10/0.12 c pscost : 0.00 0 0 0 0 0 0
0.10/0.12 c inference : 0.00 0 0 0 0 0 0
0.10/0.12 c mostinf : 0.00 0 0 0 0 0 0
0.10/0.12 c leastinf : 0.00 0 0 0 0 0 0
0.10/0.12 c fullstrong : 0.00 0 0 0 0 0 0
0.10/0.12 c allfullstrong : 0.00 0 0 0 0 0 0
0.10/0.12 c random : 0.00 0 0 0 0 0 0
0.10/0.12 c relpscost : 0.00 0 0 0 0 0 0
0.10/0.12 c Primal Heuristics : Time Calls Found
0.10/0.12 c LP solutions : 0.00 - 1
0.10/0.12 c pseudo solutions : 0.00 - 0
0.10/0.12 c feaspump : 0.00 0 0
0.10/0.12 c oneopt : 0.00 1 0
0.10/0.12 c trivial : 0.00 2 0
0.10/0.12 c simplerounding : 0.00 0 0
0.10/0.12 c zirounding : 0.00 0 0
0.10/0.12 c rounding : 0.00 1 0
0.10/0.12 c shifting : 0.00 1 1
0.10/0.12 c intshifting : 0.00 0 0
0.10/0.12 c twoopt : 0.00 0 0
0.10/0.12 c fixandinfer : 0.00 0 0
0.10/0.12 c coefdiving : 0.00 0 0
0.10/0.12 c pscostdiving : 0.00 0 0
0.10/0.12 c fracdiving : 0.00 0 0
0.10/0.12 c veclendiving : 0.00 0 0
0.10/0.12 c intdiving : 0.00 0 0
0.10/0.12 c actconsdiving : 0.00 0 0
0.10/0.12 c objpscostdiving : 0.00 0 0
0.10/0.12 c rootsoldiving : 0.00 0 0
0.10/0.12 c linesearchdiving : 0.00 0 0
0.10/0.12 c guideddiving : 0.00 0 0
0.10/0.12 c octane : 0.00 0 0
0.10/0.12 c rens : 0.00 0 0
0.10/0.12 c rins : 0.00 0 0
0.10/0.12 c localbranching : 0.00 0 0
0.10/0.12 c mutation : 0.00 0 0
0.10/0.12 c crossover : 0.00 0 0
0.10/0.12 c dins : 0.00 0 0
0.10/0.12 c undercover : 0.00 0 0
0.10/0.12 c nlp : 0.00 0 0
0.10/0.12 c trysol : 0.00 0 0
0.10/0.12 c LP : Time Calls Iterations Iter/call Iter/sec
0.10/0.12 c primal LP : 0.00 0 0 0.00 -
0.10/0.12 c dual LP : 0.00 3 22 7.33 -
0.10/0.12 c lex dual LP : 0.00 0 0 0.00 -
0.10/0.12 c barrier LP : 0.00 0 0 0.00 -
0.10/0.12 c diving/probing LP: 0.00 0 0 0.00 -
0.10/0.12 c strong branching : 0.00 0 0 0.00 -
0.10/0.12 c (at root node) : - 0 0 0.00 -
0.10/0.12 c conflict analysis: 0.00 0 0 0.00 -
0.10/0.12 c B&B Tree :
0.10/0.12 c number of runs : 3
0.10/0.12 c nodes : 1
0.10/0.12 c nodes (total) : 3
0.10/0.12 c nodes left : 0
0.10/0.12 c max depth : 0
0.10/0.12 c max depth (total): 0
0.10/0.12 c backtracks : 0 (0.0%)
0.10/0.12 c delayed cutoffs : 0
0.10/0.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.10/0.12 c avg switch length: 2.00
0.10/0.12 c switching time : 0.00
0.10/0.12 c Solution :
0.10/0.12 c Solutions found : 2 (2 improvements)
0.10/0.12 c First Solution : +6.20760000000000e+04 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <shifting>)
0.10/0.12 c Primal Bound : +6.20270000000000e+04 (in run 3, after 1 nodes, 0.06 seconds, depth 0, found by <relaxation>)
0.10/0.12 c Dual Bound : +6.20270000000000e+04
0.10/0.12 c Gap : 0.00 %
0.10/0.12 c Root Dual Bound : +6.20270000000000e+04
0.10/0.12 c Root Iterations : 22
0.10/0.12 c Time complete: 0.12.