0.00/0.01 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2664750-1276588081.opb>
0.00/0.01 c original problem has 40 variables (40 bin, 0 int, 0 impl, 0 cont) and 43 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 12 chg sides, 12 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (round 2) 0 del vars, 14 del conss, 0 chg bounds, 12 chg sides, 12 chg coeffs, 9 upgd conss, 0 impls, 0 clqs
0.00/0.02 c (round 3) 0 del vars, 14 del conss, 0 chg bounds, 12 chg sides, 12 chg coeffs, 15 upgd conss, 50 impls, 0 clqs
0.00/0.02 c (round 4) 0 del vars, 14 del conss, 0 chg bounds, 15 chg sides, 15 chg coeffs, 15 upgd conss, 50 impls, 0 clqs
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 0 deleted vars, 14 deleted constraints, 0 tightened bounds, 0 added holes, 15 changed sides, 15 changed coefficients
0.00/0.02 c 72 implications, 0 cliques
0.00/0.02 c presolved problem has 40 variables (40 bin, 0 int, 0 impl, 0 cont) and 29 constraints
0.00/0.02 c 15 constraints of type <knapsack>
0.00/0.02 c 14 constraints of type <linear>
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = -1
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.02 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.02 c 0.0s| 1 | 2 | 0 | - | 273k| 0 | - | 40 | 29 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 o 15
0.00/0.04 c * 0.0s| 68 | 24 | 0 | 0.0 | 295k| 15 | - | 40 | 46 | 0 | 0 | 0 | 17 | 0 | 0.000000e+00 | 1.500000e+01 | Inf
0.00/0.04 o 6
0.00/0.04 c * 0.0s| 79 | 16 | 0 | 0.0 | 295k| 15 | - | 40 | 49 | 0 | 0 | 0 | 20 | 0 | 0.000000e+00 | 6.000000e+00 | Inf
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 : 85
0.00/0.04 c Primal Bound : +6.00000000000000e+00 (2 solutions)
0.00/0.04 c Dual Bound : +6.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v x21 x22 x23 x24 x25 x26 x27 x28 x29 x30 -x31 x32 -x33 -x34 x35 x36 -x37 -x38 -x39 -x15 -x14 -x13 -x12 -x11 -x40 -x20 -x19 x18 -x17
0.00/0.04 v x16 -x10 -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 Solving Time : 0.03
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-2664750-1276588081.opb
0.00/0.04 c Variables : 40 (40 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 43 initial, 43 maximal
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-2664750-1276588081.opb
0.00/0.04 c Variables : 40 (40 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 29 initial, 57 maximal
0.00/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.04 c trivial : 0.00 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.00/0.04 c boundshift : 0.00 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.00/0.04 c implics : 0.00 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.00/0.04 c knapsack : 0.01 0 0 0 0 0 0 3 3
0.00/0.04 c linear : 0.00 0 0 0 0 0 14 12 12
0.00/0.04 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - 1 - - 1 - - - -
0.00/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c knapsack : 15 0 265 0 63 7 264 0 0 0
0.00/0.04 c linear : 14 0 256 0 61 17 257 0 0 0
0.00/0.04 c logicor : 0+ 0 60 0 0 0 18 0 0 0
0.00/0.04 c countsols : 0 0 0 0 63 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c linear : 0.01 0.00 0.01 0.00 0.00
0.00/0.04 c logicor : 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.04 c Propagators : Time Calls Cutoffs DomReds
0.00/0.04 c vbounds : 0.00 2 0 0
0.00/0.04 c rootredcost : 0.00 0 0 0
0.00/0.04 c pseudoobj : 0.00 187 4 15
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 28 24 71 9.8 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 : - - - 28 8.6 - - -
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: 0)
0.00/0.04 c redcost : 0.00 0 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0 0 0 0 0
0.00/0.04 c clique : 0.00 0 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 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0 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 0 0 0 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 61 0 0 0 0 122
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 - 2
0.00/0.04 c oneopt : 0.00 0 0
0.00/0.04 c trivial : 0.00 2 0
0.00/0.04 c simplerounding : 0.00 0 0
0.00/0.04 c zirounding : 0.00 0 0
0.00/0.04 c rounding : 0.00 0 0
0.00/0.04 c shifting : 0.00 0 0
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 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.00 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 undercover : 0.00 0 0
0.00/0.04 c nlp : 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 0 0 0.00 -
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 0 0 0.00 -
0.00/0.04 c (at root node) : - 0 0 0.00 -
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 : 1
0.00/0.04 c nodes : 85
0.00/0.04 c nodes (total) : 85
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 15
0.00/0.04 c max depth (total): 15
0.00/0.04 c backtracks : 29 (34.1%)
0.00/0.04 c delayed cutoffs : 13
0.00/0.04 c repropagations : 21 (117 domain reductions, 6 cutoffs)
0.00/0.04 c avg switch length: 3.60
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 2 (2 improvements)
0.00/0.04 c First Solution : +1.50000000000000e+01 (in run 1, after 68 nodes, 0.02 seconds, depth 9, found by <relaxation>)
0.00/0.04 c Primal Bound : +6.00000000000000e+00 (in run 1, after 79 nodes, 0.02 seconds, depth 10, found by <relaxation>)
0.00/0.04 c Dual Bound : +6.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +0.00000000000000e+00
0.00/0.04 c Root Iterations : 0
0.00/0.05 c Time complete: 0.04.