0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703010-1278564391.opb>
0.00/0.01 c original problem has 432 variables (432 bin, 0 int, 0 impl, 0 cont) and 333 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.04 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 0 upgd conss, 1536 impls, 0 clqs
0.00/0.04 c (round 2) 22 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 51 chg coeffs, 5 upgd conss, 2400 impls, 0 clqs
0.00/0.04 c (round 3) 40 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 67 chg coeffs, 5 upgd conss, 2976 impls, 0 clqs
0.04/0.04 c (round 4) 58 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 83 chg coeffs, 5 upgd conss, 3264 impls, 0 clqs
0.04/0.05 c (round 5) 76 del vars, 64 del conss, 0 chg bounds, 0 chg sides, 99 chg coeffs, 5 upgd conss, 3264 impls, 0 clqs
0.04/0.06 c (0.1s) probing: 158/356 (44.4%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.04/0.06 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.04/0.06 c presolving (6 rounds):
0.04/0.06 c 76 deleted vars, 64 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 99 changed coefficients
0.04/0.06 c 3280 implications, 0 cliques
0.04/0.06 c presolved problem has 356 variables (356 bin, 0 int, 0 impl, 0 cont) and 265 constraints
0.04/0.06 c 256 constraints of type <and>
0.04/0.06 c 4 constraints of type <linear>
0.04/0.06 c 5 constraints of type <logicor>
0.04/0.06 c transformed objective value is always integral (scale: 2)
0.04/0.06 c Presolving Time: 0.05
0.04/0.06 c - non default parameters ----------------------------------------------------------------------
0.04/0.06 c # SCIP version 1.2.1.3
0.04/0.06 c
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = 10000
0.04/0.06 c
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = 1790
0.04/0.06 c
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = 1620
0.04/0.06 c
0.04/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.04/0.06 c # [type: int, range: [1,2], default: 1]
0.04/0.06 c timing/clocktype = 2
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/indicator/addCouplingCons = TRUE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c heuristics/undercover/freq = 0
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/rapidlearning/freq = 0
0.04/0.06 c
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving
0.04/0.06 c
0.04/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.07 c 0.1s| 1 | 0 | 12 | - |1687k| 0 | 7 | 356 | 265 | 356 | 521 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.46 o 3
0.39/0.46 c u 0.5s| 1 | 0 | 348 | - |1717k| 0 | - | 356 | 265 | 356 | 521 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.47 c 0.5s| 1 | 0 | 348 | - |1711k| 0 | - | 356 | 265 | 356 | 521 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.47 c
0.39/0.47 c SCIP Status : problem is solved [optimal solution found]
0.39/0.47 c Solving Time (sec) : 0.46
0.39/0.47 c Solving Nodes : 1
0.39/0.47 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.39/0.47 c Dual Bound : +3.00000000000000e+00
0.39/0.47 c Gap : 0.00 %
0.39/0.47 s OPTIMUM FOUND
0.39/0.47 v -x108 -x107 x106 -x105 -x104 -x103 x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x72 x71 -x70 -x69 -x68 -x67 x66
0.39/0.47 v x65 x64 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x63 -x62 -x61 x60 -x59 x58 x57 -x56 x55 -x81 -x80 -x79 -x78 -x77 -x76
0.39/0.47 v -x75 -x74 -x73 -x54 -x53 -x52 -x51 -x50 x49 x48 x47 x46 x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 x37 -x36 -x35 -x34 -x33 -x32
0.39/0.47 v -x31 -x30 x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4
0.39/0.47 v -x3 x2 x1
0.39/0.47 c SCIP Status : problem is solved [optimal solution found]
0.39/0.47 c Solving Time : 0.46
0.39/0.47 c Original Problem :
0.39/0.47 c Problem name : HOME/instance-2703010-1278564391.opb
0.39/0.47 c Variables : 432 (432 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.47 c Constraints : 333 initial, 333 maximal
0.39/0.47 c Presolved Problem :
0.39/0.47 c Problem name : t_HOME/instance-2703010-1278564391.opb
0.39/0.47 c Variables : 356 (356 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.47 c Constraints : 265 initial, 265 maximal
0.39/0.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.47 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.47 c and : 0.02 8 64 0 0 0 64 0 64
0.39/0.47 c linear : 0.01 1 3 0 0 0 0 0 35
0.39/0.47 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c root node : - 0 - - 0 - - - -
0.39/0.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.47 c integral : 0 0 0 0 0 0 0 0 0 0
0.39/0.47 c and : 256 0 379 0 0 0 0 0 0 0
0.39/0.47 c linear : 4 0 379 0 0 0 0 0 0 0
0.39/0.47 c logicor : 5 0 67 0 0 0 0 0 0 0
0.39/0.47 c countsols : 0 0 0 0 0 0 0 0 0 0
0.39/0.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.47 c integral : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c and : 0.01 0.00 0.01 0.00 0.00
0.39/0.47 c linear : 0.01 0.00 0.01 0.00 0.00
0.39/0.47 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c Propagators : Time Calls Cutoffs DomReds
0.39/0.47 c vbounds : 0.00 2 0 0
0.39/0.47 c rootredcost : 0.00 0 0 0
0.39/0.47 c pseudoobj : 0.00 58 0 0
0.39/0.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.47 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.47 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.47 c applied globally : - - - 0 0.0 - - -
0.39/0.47 c applied locally : - - - 0 0.0 - - -
0.39/0.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.47 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.47 c redcost : 0.00 0 0 0 0 0
0.39/0.47 c impliedbounds : 0.00 0 0 0 0 0
0.39/0.47 c intobj : 0.00 0 0 0 0 0
0.39/0.47 c cgmip : 0.00 0 0 0 0 0
0.39/0.47 c gomory : 0.00 0 0 0 0 0
0.39/0.47 c strongcg : 0.00 0 0 0 0 0
0.39/0.47 c cmir : 0.00 0 0 0 0 0
0.39/0.47 c flowcover : 0.00 0 0 0 0 0
0.39/0.47 c clique : 0.00 0 0 0 0 0
0.39/0.47 c zerohalf : 0.00 0 0 0 0 0
0.39/0.47 c mcf : 0.00 0 0 0 0 0
0.39/0.47 c rapidlearning : 0.00 0 0 0 0 0
0.39/0.47 c Pricers : Time Calls Vars
0.39/0.47 c problem variables: 0.00 0 0
0.39/0.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.47 c pscost : 0.00 0 0 0 0 0 0
0.39/0.47 c inference : 0.00 0 0 0 0 0 0
0.39/0.47 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.47 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.47 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.47 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.47 c random : 0.00 0 0 0 0 0 0
0.39/0.47 c relpscost : 0.00 0 0 0 0 0 0
0.39/0.47 c Primal Heuristics : Time Calls Found
0.39/0.47 c LP solutions : 0.00 - 0
0.39/0.47 c pseudo solutions : 0.00 - 0
0.39/0.47 c oneopt : 0.00 0 0
0.39/0.47 c trivial : 0.00 2 0
0.39/0.47 c simplerounding : 0.00 0 0
0.39/0.47 c zirounding : 0.00 0 0
0.39/0.47 c rounding : 0.00 1 0
0.39/0.47 c shifting : 0.00 1 0
0.39/0.47 c intshifting : 0.00 0 0
0.39/0.47 c twoopt : 0.00 0 0
0.39/0.47 c fixandinfer : 0.00 0 0
0.39/0.47 c feaspump : 0.01 1 0
0.39/0.47 c coefdiving : 0.00 0 0
0.39/0.47 c pscostdiving : 0.00 0 0
0.39/0.47 c fracdiving : 0.00 0 0
0.39/0.47 c veclendiving : 0.00 0 0
0.39/0.47 c intdiving : 0.00 0 0
0.39/0.47 c actconsdiving : 0.00 0 0
0.39/0.47 c objpscostdiving : 0.00 0 0
0.39/0.47 c rootsoldiving : 0.00 0 0
0.39/0.47 c linesearchdiving : 0.00 0 0
0.39/0.47 c guideddiving : 0.00 0 0
0.39/0.47 c octane : 0.00 0 0
0.39/0.47 c rens : 0.00 0 0
0.39/0.47 c rins : 0.00 0 0
0.39/0.47 c localbranching : 0.00 0 0
0.39/0.47 c mutation : 0.00 0 0
0.39/0.47 c crossover : 0.00 0 0
0.39/0.47 c dins : 0.00 0 0
0.39/0.47 c undercover : 0.38 1 1
0.39/0.47 c nlp : 0.00 0 0
0.39/0.47 c trysol : 0.00 0 0
0.39/0.47 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.47 c primal LP : 0.00 0 0 0.00 -
0.39/0.47 c dual LP : 0.00 1 12 12.00 -
0.39/0.47 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.47 c barrier LP : 0.00 0 0 0.00 -
0.39/0.47 c diving/probing LP: 0.01 9 336 37.33 33600.00
0.39/0.47 c strong branching : 0.00 0 0 0.00 -
0.39/0.47 c (at root node) : - 0 0 0.00 -
0.39/0.47 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.47 c B&B Tree :
0.39/0.47 c number of runs : 1
0.39/0.47 c nodes : 1
0.39/0.47 c nodes (total) : 1
0.39/0.47 c nodes left : 0
0.39/0.47 c max depth : 0
0.39/0.47 c max depth (total): 0
0.39/0.47 c backtracks : 0 (0.0%)
0.39/0.47 c delayed cutoffs : 0
0.39/0.47 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.47 c avg switch length: 2.00
0.39/0.47 c switching time : 0.00
0.39/0.47 c Solution :
0.39/0.47 c Solutions found : 1 (1 improvements)
0.39/0.47 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.45 seconds, depth 0, found by <undercover>)
0.39/0.47 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.45 seconds, depth 0, found by <undercover>)
0.39/0.47 c Dual Bound : +3.00000000000000e+00
0.39/0.47 c Gap : 0.00 %
0.39/0.47 c Root Dual Bound : +3.00000000000000e+00
0.39/0.47 c Root Iterations : 348
0.39/0.48 c Time complete: 0.48.