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-2665062-1276648615.opb>
0.00/0.01 c original problem has 378 variables (378 bin, 0 int, 0 impl, 0 cont) and 267 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.05 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1596 impls, 0 clqs
0.00/0.05 c (round 2) 19 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 8 upgd conss, 2316 impls, 0 clqs
0.00/0.06 c (round 3) 31 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 8 upgd conss, 2916 impls, 0 clqs
0.00/0.06 c (round 4) 43 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 8 upgd conss, 3396 impls, 0 clqs
0.00/0.06 c (round 5) 55 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 3756 impls, 0 clqs
0.00/0.07 c (round 6) 67 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 82 chg coeffs, 8 upgd conss, 3996 impls, 0 clqs
0.07/0.07 c (round 7) 79 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 8 upgd conss, 4116 impls, 0 clqs
0.07/0.07 c (round 8) 91 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 8 upgd conss, 4116 impls, 0 clqs
0.07/0.09 c (0.1s) probing: 167/287 (58.2%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.07/0.09 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.07/0.09 c presolving (9 rounds):
0.07/0.09 c 91 deleted vars, 70 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 102 changed coefficients
0.07/0.09 c 4144 implications, 0 cliques
0.07/0.09 c presolved problem has 287 variables (287 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.07/0.09 c 175 constraints of type <and>
0.07/0.09 c 7 constraints of type <linear>
0.07/0.09 c 8 constraints of type <logicor>
0.07/0.09 c transformed objective value is always integral (scale: 2)
0.07/0.09 c Presolving Time: 0.04
0.07/0.09 c - non default parameters ----------------------------------------------------------------------
0.07/0.09 c # SCIP version 1.2.1.2
0.07/0.09 c
0.07/0.09 c # frequency for displaying node information lines
0.07/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.07/0.09 c display/freq = 10000
0.07/0.09 c
0.07/0.09 c # maximal time in seconds to run
0.07/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.09 c limits/time = 1800
0.07/0.09 c
0.07/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.07/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.09 c limits/memory = 1620
0.07/0.09 c
0.07/0.09 c # should presolving try to simplify inequalities
0.07/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.09 c constraints/linear/simplifyinequalities = TRUE
0.07/0.09 c
0.07/0.09 c # should presolving try to simplify knapsacks
0.07/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.07/0.09 c
0.07/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.07/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.09 c heuristics/undercover/freq = 0
0.07/0.09 c
0.07/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.07/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.09 c separating/rapidlearning/freq = 0
0.07/0.09 c
0.07/0.09 c -----------------------------------------------------------------------------------------------
0.07/0.09 c start solving
0.07/0.09 c
0.07/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.10 c 0.1s| 1 | 0 | 17 | - |1394k| 0 | 7 | 287 | 190 | 287 | 365 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.56 o 3
0.49/0.56 c u 0.3s| 1 | 0 | 17 | - |1417k| 0 | - | 287 | 190 | 287 | 365 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.57 c 0.3s| 1 | 0 | 17 | - |1412k| 0 | - | 287 | 190 | 287 | 365 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.57 c
0.49/0.57 c SCIP Status : problem is solved [optimal solution found]
0.49/0.57 c Solving Time (sec) : 0.35
0.49/0.57 c Solving Nodes : 1
0.49/0.57 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.49/0.57 c Dual Bound : +3.00000000000000e+00
0.49/0.57 c Gap : 0.00 %
0.49/0.57 s OPTIMUM FOUND
0.49/0.57 v -x126 -x125 -x124 -x123 x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 x84 x83 -x82 -x81 -x80 x79 -x114 -x113 -x112 -x111 -x110
0.49/0.57 v x109 x78 x77 x76 -x75 x74 x73 -x108 -x107 -x106 -x105 -x104 x103 x72 -x71 x70 -x69 -x68 x67 -x102 -x101 -x100 -x99 -x98 x97 x66
0.49/0.57 v -x65 -x64 -x63 x62 x61 -x96 -x95 -x94 -x93 -x92 -x91 x60 -x59 -x58 -x57 -x56 x55 -x90 -x89 -x88 -x87 -x86 x85 -x54 -x53 x52
0.49/0.57 v -x51 x50 x49 -x48 -x47 -x46 -x45 x44 x43 -x42 -x41 -x40 -x39 x38 x37 -x36 -x35 -x34 -x33 x32 x31 -x30 -x29 -x28 -x27 x26 x25
0.49/0.57 v -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.49/0.57 c SCIP Status : problem is solved [optimal solution found]
0.49/0.57 c Solving Time : 0.35
0.49/0.57 c Original Problem :
0.49/0.57 c Problem name : HOME/instance-2665062-1276648615.opb
0.49/0.57 c Variables : 378 (378 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.57 c Constraints : 267 initial, 267 maximal
0.49/0.57 c Presolved Problem :
0.49/0.57 c Problem name : t_HOME/instance-2665062-1276648615.opb
0.49/0.57 c Variables : 287 (287 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.57 c Constraints : 190 initial, 190 maximal
0.49/0.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.57 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.57 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.57 c probing : 0.01 0 0 0 0 0 0 0 0
0.49/0.57 c and : 0.02 14 70 0 0 0 70 0 70
0.49/0.57 c linear : 0.00 1 6 0 0 0 0 0 32
0.49/0.57 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.57 c root node : - 0 - - 0 - - - -
0.49/0.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.57 c integral : 0 0 0 0 0 0 0 0 0 0
0.49/0.57 c and : 175 0 403 0 0 0 0 0 0 0
0.49/0.57 c linear : 7 0 403 0 0 0 0 0 0 0
0.49/0.57 c logicor : 8 0 79 0 0 0 0 0 0 0
0.49/0.57 c countsols : 0 0 0 0 0 0 0 0 0 0
0.49/0.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.57 c integral : 0.00 0.00 0.00 0.00 0.00
0.49/0.57 c and : 0.00 0.00 0.00 0.00 0.00
0.49/0.57 c linear : 0.01 0.00 0.01 0.00 0.00
0.49/0.57 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.57 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.57 c Propagators : Time Calls Cutoffs DomReds
0.49/0.57 c vbounds : 0.00 2 0 0
0.49/0.57 c rootredcost : 0.00 0 0 0
0.49/0.57 c pseudoobj : 0.00 58 0 0
0.49/0.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.57 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.57 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.57 c applied globally : - - - 0 0.0 - - -
0.49/0.57 c applied locally : - - - 0 0.0 - - -
0.49/0.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.57 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.57 c redcost : 0.00 0 0 0 0 0
0.49/0.57 c impliedbounds : 0.00 0 0 0 0 0
0.49/0.57 c intobj : 0.00 0 0 0 0 0
0.49/0.57 c cgmip : 0.00 0 0 0 0 0
0.49/0.57 c gomory : 0.00 0 0 0 0 0
0.49/0.57 c strongcg : 0.00 0 0 0 0 0
0.49/0.57 c cmir : 0.00 0 0 0 0 0
0.49/0.57 c flowcover : 0.00 0 0 0 0 0
0.49/0.57 c clique : 0.00 0 0 0 0 0
0.49/0.57 c zerohalf : 0.00 0 0 0 0 0
0.49/0.57 c mcf : 0.00 0 0 0 0 0
0.49/0.57 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.57 c Pricers : Time Calls Vars
0.49/0.57 c problem variables: 0.00 0 0
0.49/0.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.57 c pscost : 0.00 0 0 0 0 0 0
0.49/0.57 c inference : 0.00 0 0 0 0 0 0
0.49/0.57 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.57 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.57 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.57 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.57 c random : 0.00 0 0 0 0 0 0
0.49/0.57 c relpscost : 0.00 0 0 0 0 0 0
0.49/0.57 c Primal Heuristics : Time Calls Found
0.49/0.57 c LP solutions : 0.00 - 0
0.49/0.57 c pseudo solutions : 0.00 - 0
0.49/0.57 c oneopt : 0.00 0 0
0.49/0.57 c trivial : 0.00 2 0
0.49/0.57 c simplerounding : 0.00 0 0
0.49/0.57 c zirounding : 0.00 0 0
0.49/0.57 c rounding : 0.00 1 0
0.49/0.57 c shifting : 0.00 1 0
0.49/0.57 c intshifting : 0.00 0 0
0.49/0.57 c twoopt : 0.00 0 0
0.49/0.57 c fixandinfer : 0.00 0 0
0.49/0.57 c feaspump : 0.00 1 0
0.49/0.57 c coefdiving : 0.00 0 0
0.49/0.57 c pscostdiving : 0.00 0 0
0.49/0.57 c fracdiving : 0.00 0 0
0.49/0.57 c veclendiving : 0.00 0 0
0.49/0.57 c intdiving : 0.00 0 0
0.49/0.57 c actconsdiving : 0.00 0 0
0.49/0.57 c objpscostdiving : 0.00 0 0
0.49/0.57 c rootsoldiving : 0.00 0 0
0.49/0.57 c linesearchdiving : 0.00 0 0
0.49/0.57 c guideddiving : 0.00 0 0
0.49/0.57 c octane : 0.00 0 0
0.49/0.57 c rens : 0.00 0 0
0.49/0.57 c rins : 0.00 0 0
0.49/0.57 c localbranching : 0.00 0 0
0.49/0.57 c mutation : 0.00 0 0
0.49/0.57 c crossover : 0.00 0 0
0.49/0.57 c dins : 0.00 0 0
0.49/0.57 c undercover : 0.29 1 1
0.49/0.57 c nlp : 0.00 0 0
0.49/0.57 c trysol : 0.00 0 0
0.49/0.57 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.57 c primal LP : 0.00 0 0 0.00 -
0.49/0.57 c dual LP : 0.00 1 17 17.00 -
0.49/0.57 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.57 c barrier LP : 0.00 0 0 0.00 -
0.49/0.57 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.57 c strong branching : 0.00 0 0 0.00 -
0.49/0.57 c (at root node) : - 0 0 0.00 -
0.49/0.57 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.57 c B&B Tree :
0.49/0.57 c number of runs : 1
0.49/0.57 c nodes : 1
0.49/0.57 c nodes (total) : 1
0.49/0.57 c nodes left : 0
0.49/0.57 c max depth : 0
0.49/0.57 c max depth (total): 0
0.49/0.57 c backtracks : 0 (0.0%)
0.49/0.57 c delayed cutoffs : 0
0.49/0.57 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.57 c avg switch length: 2.00
0.49/0.57 c switching time : 0.00
0.49/0.57 c Solution :
0.49/0.57 c Solutions found : 1 (1 improvements)
0.49/0.57 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.34 seconds, depth 0, found by <undercover>)
0.49/0.57 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.34 seconds, depth 0, found by <undercover>)
0.49/0.57 c Dual Bound : +3.00000000000000e+00
0.49/0.57 c Gap : 0.00 %
0.49/0.57 c Root Dual Bound : +3.00000000000000e+00
0.49/0.57 c Root Iterations : 17
0.49/0.58 c Time complete: 0.57.