0.00/0.01 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.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-2665156-1276650961.opb>
0.00/0.01 c original problem has 440 variables (440 bin, 0 int, 0 impl, 0 cont) and 331 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.07 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 0 upgd conss, 1640 impls, 0 clqs
0.00/0.07 c (round 2) 21 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 6 upgd conss, 2536 impls, 0 clqs
0.00/0.08 c (round 3) 37 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 6 upgd conss, 3208 impls, 0 clqs
0.00/0.08 c (round 4) 53 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 78 chg coeffs, 6 upgd conss, 3656 impls, 0 clqs
0.00/0.08 c (round 5) 69 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 6 upgd conss, 3880 impls, 0 clqs
0.00/0.09 c (round 6) 85 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 106 chg coeffs, 6 upgd conss, 3880 impls, 0 clqs
0.09/0.11 c (0.1s) probing: 165/355 (46.5%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.09/0.11 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.11 c presolving (7 rounds):
0.09/0.11 c 85 deleted vars, 70 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 106 changed coefficients
0.09/0.11 c 3900 implications, 0 cliques
0.09/0.11 c presolved problem has 355 variables (355 bin, 0 int, 0 impl, 0 cont) and 256 constraints
0.09/0.11 c 245 constraints of type <and>
0.09/0.11 c 5 constraints of type <linear>
0.09/0.11 c 6 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 2)
0.09/0.11 c Presolving Time: 0.06
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.2
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1800
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c heuristics/undercover/freq = 0
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/rapidlearning/freq = 0
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/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.09/0.11 c 0.1s| 1 | 0 | 14 | - |1687k| 0 | 8 | 355 | 256 | 355 | 501 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.57 o 3
0.49/0.57 c u 0.3s| 1 | 0 | 14 | - |1717k| 0 | - | 355 | 256 | 355 | 501 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.58 c 0.4s| 1 | 0 | 14 | - |1712k| 0 | - | 355 | 256 | 355 | 501 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.58 c
0.49/0.58 c SCIP Status : problem is solved [optimal solution found]
0.49/0.58 c Solving Time (sec) : 0.36
0.49/0.58 c Solving Nodes : 1
0.49/0.58 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.49/0.58 c Dual Bound : +3.00000000000000e+00
0.49/0.58 c Gap : 0.00 %
0.49/0.58 s OPTIMUM FOUND
0.49/0.58 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x80 -x79 x78 x77 x76 -x75 -x74
0.49/0.58 v x73 -x104 -x103 -x102 -x101 -x100 -x99 x98 -x97 -x72 -x71 -x70 x69 -x68 -x67 x66 x65 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89
0.49/0.58 v x64 -x63 x62 x61 -x60 -x59 -x58 x57 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x56 -x55 x54 x53 x52 -x51 x50 x49 -x48 -x47 -x46
0.49/0.58 v -x45 -x44 x43 x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 x25 -x24 -x23 -x22 -x21 -x20 -x19
0.49/0.58 v x18 x17 -x16 x15 x14 -x13 x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.49/0.58 c SCIP Status : problem is solved [optimal solution found]
0.49/0.58 c Solving Time : 0.36
0.49/0.58 c Original Problem :
0.49/0.58 c Problem name : HOME/instance-2665156-1276650961.opb
0.49/0.58 c Variables : 440 (440 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.58 c Constraints : 331 initial, 331 maximal
0.49/0.58 c Presolved Problem :
0.49/0.58 c Problem name : t_HOME/instance-2665156-1276650961.opb
0.49/0.58 c Variables : 355 (355 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.58 c Constraints : 256 initial, 256 maximal
0.49/0.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.58 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c probing : 0.02 0 0 0 0 0 0 0 0
0.49/0.58 c and : 0.03 10 70 0 0 0 70 0 70
0.49/0.58 c linear : 0.01 1 4 0 0 0 0 0 36
0.49/0.58 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c root node : - 0 - - 0 - - - -
0.49/0.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.58 c integral : 0 0 0 0 0 0 0 0 0 0
0.49/0.58 c and : 245 0 399 0 0 0 0 0 0 0
0.49/0.58 c linear : 5 0 399 0 0 0 0 0 0 0
0.49/0.58 c logicor : 6 0 78 0 0 0 0 0 0 0
0.49/0.58 c countsols : 0 0 0 0 0 0 0 0 0 0
0.49/0.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.58 c integral : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c and : 0.02 0.00 0.02 0.00 0.00
0.49/0.58 c linear : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c Propagators : Time Calls Cutoffs DomReds
0.49/0.58 c vbounds : 0.00 2 0 0
0.49/0.58 c rootredcost : 0.00 0 0 0
0.49/0.58 c pseudoobj : 0.00 62 0 0
0.49/0.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.58 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.58 c applied globally : - - - 0 0.0 - - -
0.49/0.58 c applied locally : - - - 0 0.0 - - -
0.49/0.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.58 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.58 c redcost : 0.00 0 0 0 0 0
0.49/0.58 c impliedbounds : 0.00 0 0 0 0 0
0.49/0.58 c intobj : 0.00 0 0 0 0 0
0.49/0.58 c cgmip : 0.00 0 0 0 0 0
0.49/0.58 c gomory : 0.00 0 0 0 0 0
0.49/0.58 c strongcg : 0.00 0 0 0 0 0
0.49/0.58 c cmir : 0.00 0 0 0 0 0
0.49/0.58 c flowcover : 0.00 0 0 0 0 0
0.49/0.58 c clique : 0.00 0 0 0 0 0
0.49/0.58 c zerohalf : 0.00 0 0 0 0 0
0.49/0.58 c mcf : 0.00 0 0 0 0 0
0.49/0.58 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.58 c Pricers : Time Calls Vars
0.49/0.58 c problem variables: 0.00 0 0
0.49/0.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.58 c pscost : 0.00 0 0 0 0 0 0
0.49/0.58 c inference : 0.00 0 0 0 0 0 0
0.49/0.58 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.58 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.58 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.58 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.58 c random : 0.00 0 0 0 0 0 0
0.49/0.58 c relpscost : 0.00 0 0 0 0 0 0
0.49/0.58 c Primal Heuristics : Time Calls Found
0.49/0.58 c LP solutions : 0.00 - 0
0.49/0.58 c pseudo solutions : 0.00 - 0
0.49/0.58 c oneopt : 0.00 0 0
0.49/0.58 c trivial : 0.00 2 0
0.49/0.58 c simplerounding : 0.00 0 0
0.49/0.58 c zirounding : 0.00 0 0
0.49/0.58 c rounding : 0.00 1 0
0.49/0.58 c shifting : 0.01 1 0
0.49/0.58 c intshifting : 0.00 0 0
0.49/0.58 c twoopt : 0.00 0 0
0.49/0.58 c fixandinfer : 0.00 0 0
0.49/0.58 c feaspump : 0.00 1 0
0.49/0.58 c coefdiving : 0.00 0 0
0.49/0.58 c pscostdiving : 0.00 0 0
0.49/0.58 c fracdiving : 0.00 0 0
0.49/0.58 c veclendiving : 0.00 0 0
0.49/0.58 c intdiving : 0.00 0 0
0.49/0.58 c actconsdiving : 0.00 0 0
0.49/0.58 c objpscostdiving : 0.00 0 0
0.49/0.58 c rootsoldiving : 0.00 0 0
0.49/0.58 c linesearchdiving : 0.00 0 0
0.49/0.58 c guideddiving : 0.00 0 0
0.49/0.58 c octane : 0.00 0 0
0.49/0.58 c rens : 0.00 0 0
0.49/0.58 c rins : 0.00 0 0
0.49/0.58 c localbranching : 0.00 0 0
0.49/0.58 c mutation : 0.00 0 0
0.49/0.58 c crossover : 0.00 0 0
0.49/0.58 c dins : 0.00 0 0
0.49/0.58 c undercover : 0.29 1 1
0.49/0.58 c nlp : 0.00 0 0
0.49/0.58 c trysol : 0.00 0 0
0.49/0.58 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.58 c primal LP : 0.00 0 0 0.00 -
0.49/0.58 c dual LP : 0.00 1 14 14.00 -
0.49/0.58 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.58 c barrier LP : 0.00 0 0 0.00 -
0.49/0.58 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.58 c strong branching : 0.00 0 0 0.00 -
0.49/0.58 c (at root node) : - 0 0 0.00 -
0.49/0.58 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.58 c B&B Tree :
0.49/0.58 c number of runs : 1
0.49/0.58 c nodes : 1
0.49/0.58 c nodes (total) : 1
0.49/0.58 c nodes left : 0
0.49/0.58 c max depth : 0
0.49/0.58 c max depth (total): 0
0.49/0.58 c backtracks : 0 (0.0%)
0.49/0.58 c delayed cutoffs : 0
0.49/0.58 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.58 c avg switch length: 2.00
0.49/0.58 c switching time : 0.00
0.49/0.58 c Solution :
0.49/0.58 c Solutions found : 1 (1 improvements)
0.49/0.58 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.35 seconds, depth 0, found by <undercover>)
0.49/0.58 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.35 seconds, depth 0, found by <undercover>)
0.49/0.58 c Dual Bound : +3.00000000000000e+00
0.49/0.58 c Gap : 0.00 %
0.49/0.58 c Root Dual Bound : +3.00000000000000e+00
0.49/0.58 c Root Iterations : 14
0.49/0.59 c Time complete: 0.58.