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-2703101-1278564464.opb>
0.00/0.01 c original problem has 540 variables (540 bin, 0 int, 0 impl, 0 cont) and 416 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.02/0.05 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 0 upgd conss, 2020 impls, 0 clqs
0.02/0.05 c (round 2) 23 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 6 upgd conss, 3172 impls, 0 clqs
0.02/0.05 c (round 3) 41 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 6 upgd conss, 4036 impls, 0 clqs
0.02/0.06 c (round 4) 59 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 90 chg coeffs, 6 upgd conss, 4612 impls, 0 clqs
0.02/0.06 c (round 5) 77 del vars, 64 del conss, 0 chg bounds, 0 chg sides, 106 chg coeffs, 6 upgd conss, 4900 impls, 0 clqs
0.02/0.06 c (round 6) 95 del vars, 80 del conss, 0 chg bounds, 0 chg sides, 122 chg coeffs, 6 upgd conss, 4900 impls, 0 clqs
0.02/0.08 c (0.1s) probing: 174/445 (39.1%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.02/0.08 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.02/0.08 c presolving (7 rounds):
0.02/0.08 c 95 deleted vars, 80 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 122 changed coefficients
0.02/0.08 c 4920 implications, 0 cliques
0.02/0.08 c presolved problem has 445 variables (445 bin, 0 int, 0 impl, 0 cont) and 331 constraints
0.02/0.08 c 320 constraints of type <and>
0.02/0.08 c 5 constraints of type <linear>
0.02/0.08 c 6 constraints of type <logicor>
0.02/0.08 c transformed objective value is always integral (scale: 2)
0.02/0.08 c Presolving Time: 0.06
0.02/0.08 c - non default parameters ----------------------------------------------------------------------
0.02/0.08 c # SCIP version 1.2.1.3
0.02/0.08 c
0.02/0.08 c # frequency for displaying node information lines
0.02/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.08 c display/freq = 10000
0.02/0.08 c
0.02/0.08 c # maximal time in seconds to run
0.02/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.08 c limits/time = 1789.99
0.02/0.08 c
0.02/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.08 c limits/memory = 1620
0.02/0.08 c
0.02/0.08 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.08 c # [type: int, range: [1,2], default: 1]
0.02/0.08 c timing/clocktype = 2
0.02/0.08 c
0.02/0.08 c # should presolving try to simplify inequalities
0.02/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08 c constraints/linear/simplifyinequalities = TRUE
0.02/0.08 c
0.02/0.08 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08 c constraints/indicator/addCouplingCons = TRUE
0.02/0.08 c
0.02/0.08 c # should presolving try to simplify knapsacks
0.02/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.08 c
0.02/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08 c heuristics/undercover/freq = 0
0.02/0.08 c
0.02/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08 c separating/rapidlearning/freq = 0
0.02/0.08 c
0.02/0.08 c -----------------------------------------------------------------------------------------------
0.02/0.08 c start solving
0.02/0.08 c
0.02/0.09 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.09 c 0.1s| 1 | 0 | 14 | - |2090k| 0 | 8 | 445 | 331 | 445 | 651 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.77 c 0.8s| 1 | 2 | 414 | - |2116k| 0 | 8 | 445 | 331 | 445 | 651 | 0 | 0 | 8 | 3.000000e+00 | -- | Inf
1.69/1.71 o 3
1.69/1.71 c * 1.7s| 306 | 0 | 2714 | 7.5 |2213k| 59 | - | 445 | 422 | 445 | 74 | 910 | 91 | 846 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.69/1.71 c
1.69/1.71 c SCIP Status : problem is solved [optimal solution found]
1.69/1.71 c Solving Time (sec) : 1.70
1.69/1.71 c Solving Nodes : 306
1.69/1.71 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.69/1.71 c Dual Bound : +3.00000000000000e+00
1.69/1.71 c Gap : 0.00 %
1.69/1.71 s OPTIMUM FOUND
1.69/1.71 v -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x90 x89 -x88 x87 x86
1.69/1.71 v x85 -x84 x83 x82 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 x109 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x108 -x107
1.69/1.71 v -x106 -x105 -x104 -x103 -x102 x101 x100 -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 x64 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
1.69/1.71 v -x91 -x63 -x62 -x61 -x60 -x59 x58 -x57 -x56 x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 x47 x46 -x45 x44 -x43 x42 x41 x40 -x39 x38
1.69/1.71 v x37 -x36 x35 -x34 x33 -x32 x31 -x30 x29 x28 -x27 x26 -x25 x24 -x23 x22 -x21 x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 x11
1.69/1.71 v x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
1.69/1.71 c SCIP Status : problem is solved [optimal solution found]
1.69/1.71 c Solving Time : 1.70
1.69/1.71 c Original Problem :
1.69/1.71 c Problem name : HOME/instance-2703101-1278564464.opb
1.69/1.71 c Variables : 540 (540 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.71 c Constraints : 416 initial, 416 maximal
1.69/1.71 c Presolved Problem :
1.69/1.71 c Problem name : t_HOME/instance-2703101-1278564464.opb
1.69/1.71 c Variables : 445 (445 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.71 c Constraints : 331 initial, 422 maximal
1.69/1.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.69/1.71 c trivial : 0.00 0 0 0 0 0 0 0 0
1.69/1.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.69/1.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.69/1.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.69/1.71 c implics : 0.00 0 0 0 0 0 0 0 0
1.69/1.71 c probing : 0.02 0 0 0 0 0 0 0 0
1.69/1.71 c and : 0.03 10 80 0 0 0 80 0 80
1.69/1.71 c linear : 0.01 1 4 0 0 0 0 0 42
1.69/1.71 c logicor : 0.00 0 0 0 0 0 0 0 0
1.69/1.71 c root node : - 0 - - 0 - - - -
1.69/1.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.69/1.71 c integral : 0 0 0 278 0 0 33 0 0 514
1.69/1.71 c and : 320 568 1378 1 0 13 1645 910 0 0
1.69/1.71 c linear : 5 1 1365 1 0 51 597 0 0 0
1.69/1.71 c logicor : 6+ 1 211 1 0 1 25 0 0 0
1.69/1.71 c countsols : 0 0 0 1 0 0 0 0 0 0
1.69/1.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.69/1.71 c integral : 0.41 0.00 0.00 0.41 0.00
1.69/1.71 c and : 0.04 0.03 0.01 0.00 0.00
1.69/1.71 c linear : 0.04 0.00 0.04 0.00 0.00
1.69/1.71 c logicor : 0.00 0.00 0.00 0.00 0.00
1.69/1.71 c countsols : 0.00 0.00 0.00 0.00 0.00
1.69/1.71 c Propagators : Time Calls Cutoffs DomReds
1.69/1.71 c vbounds : 0.00 2 0 0
1.69/1.71 c rootredcost : 0.00 0 0 0
1.69/1.71 c pseudoobj : 0.00 1023 0 0
1.69/1.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.71 c propagation : 0.02 65 46 535 67.7 10 21.0 -
1.69/1.71 c infeasible LP : 0.00 34 34 70 34.4 0 0.0 0
1.69/1.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.71 c applied globally : - - - 91 17.2 - - -
1.69/1.71 c applied locally : - - - 0 0.0 - - -
1.69/1.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.71 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.69/1.71 c redcost : 0.00 568 0 0 0 0
1.69/1.71 c impliedbounds : 0.00 1 0 0 0 0
1.69/1.71 c intobj : 0.00 0 0 0 0 0
1.69/1.71 c cgmip : 0.00 0 0 0 0 0
1.69/1.71 c gomory : 0.00 1 0 0 0 0
1.69/1.71 c strongcg : 0.00 1 0 0 0 0
1.69/1.71 c cmir : 0.00 1 0 0 0 0
1.69/1.71 c flowcover : 0.01 1 0 0 0 0
1.69/1.71 c clique : 0.00 1 0 0 0 0
1.69/1.71 c zerohalf : 0.00 0 0 0 0 0
1.69/1.71 c mcf : 0.00 1 0 0 0 0
1.69/1.71 c rapidlearning : 0.07 1 0 0 0 0
1.69/1.71 c Pricers : Time Calls Vars
1.69/1.71 c problem variables: 0.00 0 0
1.69/1.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.71 c relpscost : 0.41 277 0 33 0 0 514
1.69/1.71 c pscost : 0.00 0 0 0 0 0 0
1.69/1.71 c inference : 0.00 0 0 0 0 0 0
1.69/1.71 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.71 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.71 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.71 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.71 c random : 0.00 0 0 0 0 0 0
1.69/1.71 c Primal Heuristics : Time Calls Found
1.69/1.71 c LP solutions : 0.00 - 1
1.69/1.71 c pseudo solutions : 0.00 - 0
1.69/1.71 c oneopt : 0.00 0 0
1.69/1.71 c crossover : 0.00 0 0
1.69/1.71 c guideddiving : 0.00 0 0
1.69/1.71 c intshifting : 0.00 0 0
1.69/1.71 c coefdiving : 0.01 1 0
1.69/1.71 c pscostdiving : 0.01 1 0
1.69/1.71 c fracdiving : 0.01 1 0
1.69/1.71 c veclendiving : 0.00 1 0
1.69/1.71 c linesearchdiving : 0.01 1 0
1.69/1.71 c objpscostdiving : 0.01 1 0
1.69/1.71 c feaspump : 0.02 1 0
1.69/1.71 c rootsoldiving : 0.09 1 0
1.69/1.71 c trivial : 0.00 2 0
1.69/1.71 c simplerounding : 0.00 0 0
1.69/1.71 c zirounding : 0.01 255 0
1.69/1.71 c rounding : 0.01 296 0
1.69/1.71 c shifting : 0.11 52 0
1.69/1.71 c twoopt : 0.00 0 0
1.69/1.71 c fixandinfer : 0.00 0 0
1.69/1.71 c intdiving : 0.00 0 0
1.69/1.71 c actconsdiving : 0.00 0 0
1.69/1.71 c octane : 0.00 0 0
1.69/1.71 c rens : 0.02 1 0
1.69/1.71 c rins : 0.00 0 0
1.69/1.71 c localbranching : 0.00 0 0
1.69/1.71 c mutation : 0.00 0 0
1.69/1.71 c dins : 0.00 0 0
1.69/1.71 c undercover : 0.53 1 0
1.69/1.71 c nlp : 0.00 0 0
1.69/1.71 c trysol : 0.00 0 0
1.69/1.71 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.71 c primal LP : 0.01 0 0 0.00 0.00
1.69/1.71 c dual LP : 0.12 590 1615 2.74 13238.03
1.69/1.71 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.71 c barrier LP : 0.00 0 0 0.00 -
1.69/1.71 c diving/probing LP: 0.09 305 1099 3.60 11568.79
1.69/1.71 c strong branching : 0.41 846 4216 4.98 10384.57
1.69/1.71 c (at root node) : - 8 149 18.62 -
1.69/1.71 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.71 c B&B Tree :
1.69/1.71 c number of runs : 1
1.69/1.71 c nodes : 306
1.69/1.71 c nodes (total) : 306
1.69/1.71 c nodes left : 0
1.69/1.71 c max depth : 59
1.69/1.71 c max depth (total): 59
1.69/1.71 c backtracks : 28 (9.2%)
1.69/1.71 c delayed cutoffs : 9
1.69/1.71 c repropagations : 28 (136 domain reductions, 9 cutoffs)
1.69/1.71 c avg switch length: 2.97
1.69/1.71 c switching time : 0.02
1.69/1.71 c Solution :
1.69/1.71 c Solutions found : 1 (1 improvements)
1.69/1.71 c First Solution : +3.00000000000000e+00 (in run 1, after 306 nodes, 1.70 seconds, depth 55, found by <relaxation>)
1.69/1.71 c Primal Bound : +3.00000000000000e+00 (in run 1, after 306 nodes, 1.70 seconds, depth 55, found by <relaxation>)
1.69/1.71 c Dual Bound : +3.00000000000000e+00
1.69/1.71 c Gap : 0.00 %
1.69/1.71 c Root Dual Bound : +3.00000000000000e+00
1.69/1.71 c Root Iterations : 414
1.69/1.72 c Time complete: 1.72.