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-2665049-1276648330.opb>
0.00/0.01 c original problem has 162 variables (162 bin, 0 int, 0 impl, 0 cont) and 115 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, 16 chg coeffs, 0 upgd conss, 516 impls, 0 clqs
0.00/0.03 c (round 2) 15 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 4 upgd conss, 756 impls, 0 clqs
0.02/0.03 c (round 3) 27 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 4 upgd conss, 876 impls, 0 clqs
0.02/0.03 c (round 4) 39 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 4 upgd conss, 876 impls, 0 clqs
0.02/0.04 c presolving (5 rounds):
0.02/0.04 c 39 deleted vars, 30 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 46 changed coefficients
0.02/0.04 c 894 implications, 0 cliques
0.02/0.04 c presolved problem has 123 variables (123 bin, 0 int, 0 impl, 0 cont) and 82 constraints
0.02/0.04 c 75 constraints of type <and>
0.02/0.04 c 3 constraints of type <linear>
0.02/0.04 c 4 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 2)
0.02/0.04 c Presolving Time: 0.02
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 1.2.1.2
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1800
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 1620
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c heuristics/undercover/freq = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.05 c 0.0s| 1 | 0 | 10 | - | 661k| 0 | 5 | 123 | 82 | 123 | 157 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.20/0.20 o 3
0.20/0.20 c u 0.1s| 1 | 0 | 10 | - | 668k| 0 | - | 123 | 82 | 123 | 157 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.20/0.21 c 0.1s| 1 | 0 | 10 | - | 666k| 0 | - | 123 | 82 | 123 | 157 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.20/0.21 c
0.20/0.21 c SCIP Status : problem is solved [optimal solution found]
0.20/0.21 c Solving Time (sec) : 0.10
0.20/0.21 c Solving Nodes : 1
0.20/0.21 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.20/0.21 c Dual Bound : +3.00000000000000e+00
0.20/0.21 c Gap : 0.00 %
0.20/0.21 s OPTIMUM FOUND
0.20/0.21 v -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x36 -x35 x34 -x33 x32 x31 -x42 -x41 -x40 -x39 x38 -x37 -x30 x29 x28
0.20/0.21 v -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.20/0.21 c SCIP Status : problem is solved [optimal solution found]
0.20/0.21 c Solving Time : 0.10
0.20/0.21 c Original Problem :
0.20/0.21 c Problem name : HOME/instance-2665049-1276648330.opb
0.20/0.21 c Variables : 162 (162 binary, 0 integer, 0 implicit integer, 0 continuous)
0.20/0.21 c Constraints : 115 initial, 115 maximal
0.20/0.21 c Presolved Problem :
0.20/0.21 c Problem name : t_HOME/instance-2665049-1276648330.opb
0.20/0.21 c Variables : 123 (123 binary, 0 integer, 0 implicit integer, 0 continuous)
0.20/0.21 c Constraints : 82 initial, 82 maximal
0.20/0.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.20/0.21 c trivial : 0.00 0 0 0 0 0 0 0 0
0.20/0.21 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.20/0.21 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.20/0.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.20/0.21 c implics : 0.00 0 0 0 0 0 0 0 0
0.20/0.21 c probing : 0.01 0 0 0 0 0 0 0 0
0.20/0.21 c and : 0.01 6 30 0 0 0 30 0 30
0.20/0.21 c linear : 0.00 1 2 0 0 0 0 0 16
0.20/0.21 c logicor : 0.00 0 0 0 0 0 0 0 0
0.20/0.21 c root node : - 0 - - 0 - - - -
0.20/0.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.20/0.21 c integral : 0 0 0 0 0 0 0 0 0 0
0.20/0.21 c and : 75 0 280 0 0 0 0 0 0 0
0.20/0.21 c linear : 3 0 280 0 0 0 0 0 0 0
0.20/0.21 c logicor : 4 0 55 0 0 0 0 0 0 0
0.20/0.21 c countsols : 0 0 0 0 0 0 0 0 0 0
0.20/0.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.20/0.21 c integral : 0.00 0.00 0.00 0.00 0.00
0.20/0.21 c and : 0.01 0.00 0.01 0.00 0.00
0.20/0.21 c linear : 0.01 0.00 0.01 0.00 0.00
0.20/0.21 c logicor : 0.00 0.00 0.00 0.00 0.00
0.20/0.21 c countsols : 0.00 0.00 0.00 0.00 0.00
0.20/0.21 c Propagators : Time Calls Cutoffs DomReds
0.20/0.21 c vbounds : 0.00 2 0 0
0.20/0.21 c rootredcost : 0.00 0 0 0
0.20/0.21 c pseudoobj : 0.00 26 0 0
0.20/0.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.20/0.21 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.20/0.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.20/0.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.20/0.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.20/0.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.20/0.21 c applied globally : - - - 0 0.0 - - -
0.20/0.21 c applied locally : - - - 0 0.0 - - -
0.20/0.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.20/0.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.20/0.21 c redcost : 0.00 0 0 0 0 0
0.20/0.21 c impliedbounds : 0.00 0 0 0 0 0
0.20/0.21 c intobj : 0.00 0 0 0 0 0
0.20/0.21 c cgmip : 0.00 0 0 0 0 0
0.20/0.21 c gomory : 0.00 0 0 0 0 0
0.20/0.21 c strongcg : 0.00 0 0 0 0 0
0.20/0.21 c cmir : 0.00 0 0 0 0 0
0.20/0.21 c flowcover : 0.00 0 0 0 0 0
0.20/0.21 c clique : 0.00 0 0 0 0 0
0.20/0.21 c zerohalf : 0.00 0 0 0 0 0
0.20/0.21 c mcf : 0.00 0 0 0 0 0
0.20/0.21 c rapidlearning : 0.00 0 0 0 0 0
0.20/0.21 c Pricers : Time Calls Vars
0.20/0.21 c problem variables: 0.00 0 0
0.20/0.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.20/0.21 c pscost : 0.00 0 0 0 0 0 0
0.20/0.21 c inference : 0.00 0 0 0 0 0 0
0.20/0.21 c mostinf : 0.00 0 0 0 0 0 0
0.20/0.21 c leastinf : 0.00 0 0 0 0 0 0
0.20/0.21 c fullstrong : 0.00 0 0 0 0 0 0
0.20/0.21 c allfullstrong : 0.00 0 0 0 0 0 0
0.20/0.21 c random : 0.00 0 0 0 0 0 0
0.20/0.21 c relpscost : 0.00 0 0 0 0 0 0
0.20/0.21 c Primal Heuristics : Time Calls Found
0.20/0.21 c LP solutions : 0.00 - 0
0.20/0.21 c pseudo solutions : 0.00 - 0
0.20/0.21 c oneopt : 0.00 0 0
0.20/0.21 c trivial : 0.00 2 0
0.20/0.21 c simplerounding : 0.00 0 0
0.20/0.21 c zirounding : 0.00 0 0
0.20/0.21 c rounding : 0.00 1 0
0.20/0.21 c shifting : 0.00 1 0
0.20/0.21 c intshifting : 0.00 0 0
0.20/0.21 c twoopt : 0.00 0 0
0.20/0.21 c fixandinfer : 0.00 0 0
0.20/0.21 c feaspump : 0.00 1 0
0.20/0.21 c coefdiving : 0.00 0 0
0.20/0.21 c pscostdiving : 0.00 0 0
0.20/0.21 c fracdiving : 0.00 0 0
0.20/0.21 c veclendiving : 0.00 0 0
0.20/0.21 c intdiving : 0.00 0 0
0.20/0.21 c actconsdiving : 0.00 0 0
0.20/0.21 c objpscostdiving : 0.00 0 0
0.20/0.21 c rootsoldiving : 0.00 0 0
0.20/0.21 c linesearchdiving : 0.00 0 0
0.20/0.21 c guideddiving : 0.00 0 0
0.20/0.21 c octane : 0.00 0 0
0.20/0.21 c rens : 0.00 0 0
0.20/0.21 c rins : 0.00 0 0
0.20/0.21 c localbranching : 0.00 0 0
0.20/0.21 c mutation : 0.00 0 0
0.20/0.21 c crossover : 0.00 0 0
0.20/0.21 c dins : 0.00 0 0
0.20/0.21 c undercover : 0.08 1 1
0.20/0.21 c nlp : 0.00 0 0
0.20/0.21 c trysol : 0.00 0 0
0.20/0.21 c LP : Time Calls Iterations Iter/call Iter/sec
0.20/0.21 c primal LP : 0.00 0 0 0.00 -
0.20/0.21 c dual LP : 0.00 1 10 10.00 -
0.20/0.21 c lex dual LP : 0.00 0 0 0.00 -
0.20/0.21 c barrier LP : 0.00 0 0 0.00 -
0.20/0.21 c diving/probing LP: 0.00 0 0 0.00 -
0.20/0.21 c strong branching : 0.00 0 0 0.00 -
0.20/0.21 c (at root node) : - 0 0 0.00 -
0.20/0.21 c conflict analysis: 0.00 0 0 0.00 -
0.20/0.21 c B&B Tree :
0.20/0.21 c number of runs : 1
0.20/0.21 c nodes : 1
0.20/0.21 c nodes (total) : 1
0.20/0.21 c nodes left : 0
0.20/0.21 c max depth : 0
0.20/0.21 c max depth (total): 0
0.20/0.21 c backtracks : 0 (0.0%)
0.20/0.21 c delayed cutoffs : 0
0.20/0.21 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.20/0.21 c avg switch length: 2.00
0.20/0.21 c switching time : 0.00
0.20/0.21 c Solution :
0.20/0.21 c Solutions found : 1 (1 improvements)
0.20/0.21 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <undercover>)
0.20/0.21 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <undercover>)
0.20/0.21 c Dual Bound : +3.00000000000000e+00
0.20/0.21 c Gap : 0.00 %
0.20/0.21 c Root Dual Bound : +3.00000000000000e+00
0.20/0.21 c Root Iterations : 10
0.20/0.21 c Time complete: 0.21.