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-2665024-1276647839.opb>
0.00/0.01 c original problem has 176 variables (176 bin, 0 int, 0 impl, 0 cont) and 133 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) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 548 impls, 0 clqs
0.00/0.03 c (round 2) 18 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 3 upgd conss, 772 impls, 0 clqs
0.00/0.03 c (round 3) 34 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 3 upgd conss, 772 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 125/142 (88.0%) - 0 fixings, 0 aggregations, 4 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (4 rounds):
0.00/0.04 c 34 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 46 changed coefficients
0.00/0.04 c 780 implications, 0 cliques
0.00/0.04 c presolved problem has 142 variables (142 bin, 0 int, 0 impl, 0 cont) and 103 constraints
0.00/0.04 c 98 constraints of type <and>
0.00/0.04 c 2 constraints of type <linear>
0.00/0.04 c 3 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 2)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1800
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
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 | 7 | - | 739k| 0 | 4 | 142 | 103 | 142 | 201 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.39 o 3
0.29/0.39 c u 0.2s| 1 | 0 | 7 | - | 750k| 0 | - | 142 | 103 | 142 | 201 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.40 c 0.2s| 1 | 0 | 7 | - | 748k| 0 | - | 142 | 103 | 142 | 201 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.40 c
0.39/0.40 c SCIP Status : problem is solved [optimal solution found]
0.39/0.40 c Solving Time (sec) : 0.23
0.39/0.40 c Solving Nodes : 1
0.39/0.40 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.39/0.40 c Dual Bound : +3.00000000000000e+00
0.39/0.40 c Gap : 0.00 %
0.39/0.40 s OPTIMUM FOUND
0.39/0.40 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 x28 x27 x26 x25 -x24 -x23 -x22
0.39/0.40 v x21 -x20 -x19 x18 x17 -x16 -x15 -x14 -x13 -x12 x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.39/0.40 c SCIP Status : problem is solved [optimal solution found]
0.39/0.40 c Solving Time : 0.23
0.39/0.40 c Original Problem :
0.39/0.40 c Problem name : HOME/instance-2665024-1276647839.opb
0.39/0.40 c Variables : 176 (176 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 133 initial, 133 maximal
0.39/0.40 c Presolved Problem :
0.39/0.40 c Problem name : t_HOME/instance-2665024-1276647839.opb
0.39/0.40 c Variables : 142 (142 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 103 initial, 103 maximal
0.39/0.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.40 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.40 c and : 0.00 4 28 0 0 0 28 0 28
0.39/0.40 c linear : 0.00 1 1 0 0 0 0 0 18
0.39/0.40 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c root node : - 0 - - 0 - - - -
0.39/0.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.40 c integral : 0 0 0 0 0 0 0 0 0 0
0.39/0.40 c and : 98 0 277 0 0 0 0 0 0 0
0.39/0.40 c linear : 2 0 277 0 0 0 0 0 0 0
0.39/0.40 c logicor : 3 0 56 0 0 0 0 0 0 0
0.39/0.40 c countsols : 0 0 0 0 0 0 0 0 0 0
0.39/0.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.40 c integral : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c and : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c linear : 0.01 0.00 0.01 0.00 0.00
0.39/0.40 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c Propagators : Time Calls Cutoffs DomReds
0.39/0.40 c vbounds : 0.00 2 0 0
0.39/0.40 c rootredcost : 0.00 0 0 0
0.39/0.40 c pseudoobj : 0.00 26 0 0
0.39/0.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.40 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.40 c applied globally : - - - 0 0.0 - - -
0.39/0.40 c applied locally : - - - 0 0.0 - - -
0.39/0.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.40 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.40 c redcost : 0.00 0 0 0 0 0
0.39/0.40 c impliedbounds : 0.00 0 0 0 0 0
0.39/0.40 c intobj : 0.00 0 0 0 0 0
0.39/0.40 c cgmip : 0.00 0 0 0 0 0
0.39/0.40 c gomory : 0.00 0 0 0 0 0
0.39/0.40 c strongcg : 0.00 0 0 0 0 0
0.39/0.40 c cmir : 0.00 0 0 0 0 0
0.39/0.40 c flowcover : 0.00 0 0 0 0 0
0.39/0.40 c clique : 0.00 0 0 0 0 0
0.39/0.40 c zerohalf : 0.00 0 0 0 0 0
0.39/0.40 c mcf : 0.00 0 0 0 0 0
0.39/0.40 c rapidlearning : 0.00 0 0 0 0 0
0.39/0.40 c Pricers : Time Calls Vars
0.39/0.40 c problem variables: 0.00 0 0
0.39/0.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.40 c pscost : 0.00 0 0 0 0 0 0
0.39/0.40 c inference : 0.00 0 0 0 0 0 0
0.39/0.40 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.40 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.40 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.40 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.40 c random : 0.00 0 0 0 0 0 0
0.39/0.40 c relpscost : 0.00 0 0 0 0 0 0
0.39/0.40 c Primal Heuristics : Time Calls Found
0.39/0.40 c LP solutions : 0.00 - 0
0.39/0.40 c pseudo solutions : 0.00 - 0
0.39/0.40 c oneopt : 0.00 0 0
0.39/0.40 c trivial : 0.00 2 0
0.39/0.40 c simplerounding : 0.00 0 0
0.39/0.40 c zirounding : 0.00 0 0
0.39/0.40 c rounding : 0.00 1 0
0.39/0.40 c shifting : 0.00 1 0
0.39/0.40 c intshifting : 0.00 0 0
0.39/0.40 c twoopt : 0.00 0 0
0.39/0.40 c fixandinfer : 0.00 0 0
0.39/0.40 c feaspump : 0.00 1 0
0.39/0.40 c coefdiving : 0.00 0 0
0.39/0.40 c pscostdiving : 0.00 0 0
0.39/0.40 c fracdiving : 0.00 0 0
0.39/0.40 c veclendiving : 0.00 0 0
0.39/0.40 c intdiving : 0.00 0 0
0.39/0.40 c actconsdiving : 0.00 0 0
0.39/0.40 c objpscostdiving : 0.00 0 0
0.39/0.40 c rootsoldiving : 0.00 0 0
0.39/0.40 c linesearchdiving : 0.00 0 0
0.39/0.40 c guideddiving : 0.00 0 0
0.39/0.40 c octane : 0.00 0 0
0.39/0.40 c rens : 0.00 0 0
0.39/0.40 c rins : 0.00 0 0
0.39/0.40 c localbranching : 0.00 0 0
0.39/0.40 c mutation : 0.00 0 0
0.39/0.40 c crossover : 0.00 0 0
0.39/0.40 c dins : 0.00 0 0
0.39/0.40 c undercover : 0.20 1 1
0.39/0.40 c nlp : 0.00 0 0
0.39/0.40 c trysol : 0.00 0 0
0.39/0.40 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.40 c primal LP : 0.00 0 0 0.00 -
0.39/0.40 c dual LP : 0.00 1 7 7.00 -
0.39/0.40 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.40 c barrier LP : 0.00 0 0 0.00 -
0.39/0.40 c diving/probing LP: 0.00 0 0 0.00 -
0.39/0.40 c strong branching : 0.00 0 0 0.00 -
0.39/0.40 c (at root node) : - 0 0 0.00 -
0.39/0.40 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.40 c B&B Tree :
0.39/0.40 c number of runs : 1
0.39/0.40 c nodes : 1
0.39/0.40 c nodes (total) : 1
0.39/0.40 c nodes left : 0
0.39/0.40 c max depth : 0
0.39/0.40 c max depth (total): 0
0.39/0.40 c backtracks : 0 (0.0%)
0.39/0.40 c delayed cutoffs : 0
0.39/0.40 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.40 c avg switch length: 2.00
0.39/0.40 c switching time : 0.00
0.39/0.40 c Solution :
0.39/0.40 c Solutions found : 1 (1 improvements)
0.39/0.40 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.23 seconds, depth 0, found by <undercover>)
0.39/0.40 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.23 seconds, depth 0, found by <undercover>)
0.39/0.40 c Dual Bound : +3.00000000000000e+00
0.39/0.40 c Gap : 0.00 %
0.39/0.40 c Root Dual Bound : +3.00000000000000e+00
0.39/0.40 c Root Iterations : 7
0.39/0.41 c Time complete: 0.4.