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-2703113-1278564477.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.03/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.03/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.03/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.03/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.03/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.03/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.03/0.08 c (0.1s) probing: 174/445 (39.1%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.03/0.08 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.03/0.08 c presolving (7 rounds):
0.03/0.08 c 95 deleted vars, 80 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 122 changed coefficients
0.03/0.08 c 4920 implications, 0 cliques
0.03/0.08 c presolved problem has 445 variables (445 bin, 0 int, 0 impl, 0 cont) and 331 constraints
0.03/0.08 c 320 constraints of type <and>
0.03/0.08 c 5 constraints of type <linear>
0.03/0.08 c 6 constraints of type <logicor>
0.03/0.08 c transformed objective value is always integral (scale: 2)
0.03/0.08 c Presolving Time: 0.06
0.03/0.08 c - non default parameters ----------------------------------------------------------------------
0.03/0.08 c # SCIP version 1.2.1.3
0.03/0.08 c
0.03/0.08 c # frequency for displaying node information lines
0.03/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.08 c display/freq = 10000
0.03/0.08 c
0.03/0.08 c # maximal time in seconds to run
0.03/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.08 c limits/time = 1790
0.03/0.08 c
0.03/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.08 c limits/memory = 1620
0.03/0.08 c
0.03/0.08 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.08 c # [type: int, range: [1,2], default: 1]
0.03/0.08 c timing/clocktype = 2
0.03/0.08 c
0.03/0.08 c # should presolving try to simplify inequalities
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c constraints/linear/simplifyinequalities = TRUE
0.03/0.08 c
0.03/0.08 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c constraints/indicator/addCouplingCons = TRUE
0.03/0.08 c
0.03/0.08 c # should presolving try to simplify knapsacks
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.08 c
0.03/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.08 c heuristics/undercover/freq = 0
0.03/0.08 c
0.03/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.08 c separating/rapidlearning/freq = 0
0.03/0.08 c
0.03/0.08 c -----------------------------------------------------------------------------------------------
0.03/0.08 c start solving
0.03/0.08 c
0.03/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.03/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
3.30/3.30 o 3
3.30/3.30 c * 3.3s| 957 | 0 | 6344 | 6.2 |2417k| 55 | - | 445 | 635 | 445 | 118 |2801 | 306 |2080 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.30/3.30 c
3.30/3.31 c SCIP Status : problem is solved [optimal solution found]
3.30/3.31 c Solving Time (sec) : 3.29
3.30/3.31 c Solving Nodes : 957
3.30/3.31 c Primal Bound : +3.00000000000000e+00 (1 solutions)
3.30/3.31 c Dual Bound : +3.00000000000000e+00
3.30/3.31 c Gap : 0.00 %
3.30/3.31 s OPTIMUM FOUND
3.30/3.31 v -x135 x134 -x133 -x132 x131 -x130 x129 -x128 x127 -x126 -x125 x124 -x123 -x122 -x121 x120 -x119 x118 x90 -x89 -x88 x87 -x86 x85
3.30/3.31 v -x84 -x83 x82 -x117 x116 -x115 -x114 x113 -x112 -x111 -x110 x109 x81 -x80 -x79 -x78 x77 x76 x75 -x74 x73 -x108 -x107 -x106 -x105
3.30/3.31 v -x104 -x103 -x102 -x101 -x100 x72 -x71 -x70 -x69 x68 -x67 -x66 x65 x64 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x63
3.30/3.31 v -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 x37 x36 -x35
3.30/3.31 v -x34 -x33 -x32 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
3.30/3.31 v -x6 -x5 -x4 -x3 x2 x1
3.30/3.31 c SCIP Status : problem is solved [optimal solution found]
3.30/3.31 c Solving Time : 3.29
3.30/3.31 c Original Problem :
3.30/3.31 c Problem name : HOME/instance-2703113-1278564477.opb
3.30/3.31 c Variables : 540 (540 binary, 0 integer, 0 implicit integer, 0 continuous)
3.30/3.31 c Constraints : 416 initial, 416 maximal
3.30/3.31 c Presolved Problem :
3.30/3.31 c Problem name : t_HOME/instance-2703113-1278564477.opb
3.30/3.31 c Variables : 445 (445 binary, 0 integer, 0 implicit integer, 0 continuous)
3.30/3.31 c Constraints : 331 initial, 635 maximal
3.30/3.31 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.30/3.31 c trivial : 0.00 0 0 0 0 0 0 0 0
3.30/3.31 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.30/3.31 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.30/3.31 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.30/3.31 c implics : 0.00 0 0 0 0 0 0 0 0
3.30/3.31 c probing : 0.02 0 0 0 0 0 0 0 0
3.30/3.31 c and : 0.03 10 80 0 0 0 80 0 80
3.30/3.31 c linear : 0.01 1 4 0 0 0 0 0 42
3.30/3.31 c logicor : 0.00 0 0 0 0 0 0 0 0
3.30/3.31 c root node : - 0 - - 0 - - - -
3.30/3.31 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.30/3.31 c integral : 0 0 0 777 0 1 62 0 0 1450
3.30/3.31 c and : 320 1741 3320 1 0 53 5119 2801 0 0
3.30/3.31 c linear : 5 1 3267 1 0 240 1802 0 0 0
3.30/3.31 c logicor : 6+ 1 775 1 0 2 142 0 0 0
3.30/3.31 c countsols : 0 0 0 1 0 0 0 0 0 0
3.30/3.31 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.30/3.31 c integral : 1.10 0.00 0.00 1.10 0.00
3.30/3.31 c and : 0.14 0.09 0.05 0.00 0.00
3.30/3.31 c linear : 0.14 0.00 0.14 0.00 0.00
3.30/3.31 c logicor : 0.00 0.00 0.00 0.00 0.00
3.30/3.31 c countsols : 0.00 0.00 0.00 0.00 0.00
3.30/3.31 c Propagators : Time Calls Cutoffs DomReds
3.30/3.31 c vbounds : 0.00 2 0 0
3.30/3.31 c rootredcost : 0.00 0 0 0
3.30/3.31 c pseudoobj : 0.00 2965 0 0
3.30/3.31 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.30/3.31 c propagation : 0.09 295 206 2603 60.4 18 34.7 -
3.30/3.31 c infeasible LP : 0.00 37 37 41 13.3 0 0.0 0
3.30/3.31 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.30/3.31 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.30/3.31 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.30/3.31 c applied globally : - - - 304 18.9 - - -
3.30/3.31 c applied locally : - - - 2 54.5 - - -
3.30/3.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.30/3.31 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.30/3.31 c redcost : 0.01 1741 0 0 0 0
3.30/3.31 c impliedbounds : 0.00 1 0 0 0 0
3.30/3.31 c intobj : 0.00 0 0 0 0 0
3.30/3.31 c cgmip : 0.00 0 0 0 0 0
3.30/3.31 c gomory : 0.00 1 0 0 0 0
3.30/3.31 c strongcg : 0.00 1 0 0 0 0
3.30/3.31 c cmir : 0.00 1 0 0 0 0
3.30/3.31 c flowcover : 0.01 1 0 0 0 0
3.30/3.31 c clique : 0.00 1 0 0 0 0
3.30/3.31 c zerohalf : 0.00 0 0 0 0 0
3.30/3.31 c mcf : 0.00 1 0 0 0 0
3.30/3.31 c rapidlearning : 0.07 1 0 0 0 0
3.30/3.31 c Pricers : Time Calls Vars
3.30/3.31 c problem variables: 0.00 0 0
3.30/3.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.30/3.31 c relpscost : 1.10 776 1 62 0 0 1450
3.30/3.31 c pscost : 0.00 0 0 0 0 0 0
3.30/3.31 c inference : 0.00 0 0 0 0 0 0
3.30/3.31 c mostinf : 0.00 0 0 0 0 0 0
3.30/3.31 c leastinf : 0.00 0 0 0 0 0 0
3.30/3.31 c fullstrong : 0.00 0 0 0 0 0 0
3.30/3.31 c allfullstrong : 0.00 0 0 0 0 0 0
3.30/3.31 c random : 0.00 0 0 0 0 0 0
3.30/3.31 c Primal Heuristics : Time Calls Found
3.30/3.31 c LP solutions : 0.00 - 1
3.30/3.31 c pseudo solutions : 0.00 - 0
3.30/3.31 c oneopt : 0.00 0 0
3.30/3.31 c crossover : 0.00 0 0
3.30/3.31 c guideddiving : 0.00 0 0
3.30/3.31 c intshifting : 0.00 0 0
3.30/3.31 c objpscostdiving : 0.01 1 0
3.30/3.31 c feaspump : 0.02 1 0
3.30/3.31 c rootsoldiving : 0.12 1 0
3.30/3.31 c coefdiving : 0.01 2 0
3.30/3.31 c pscostdiving : 0.01 2 0
3.30/3.31 c fracdiving : 0.02 2 0
3.30/3.31 c veclendiving : 0.01 2 0
3.30/3.31 c linesearchdiving : 0.01 2 0
3.30/3.31 c trivial : 0.00 2 0
3.30/3.31 c simplerounding : 0.00 0 0
3.30/3.31 c zirounding : 0.01 724 0
3.30/3.31 c rounding : 0.02 540 0
3.30/3.31 c shifting : 0.25 136 0
3.30/3.31 c twoopt : 0.00 0 0
3.30/3.31 c fixandinfer : 0.00 0 0
3.30/3.31 c intdiving : 0.00 0 0
3.30/3.31 c actconsdiving : 0.00 0 0
3.30/3.31 c octane : 0.00 0 0
3.30/3.31 c rens : 0.02 1 0
3.30/3.31 c rins : 0.00 0 0
3.30/3.31 c localbranching : 0.00 0 0
3.30/3.31 c mutation : 0.00 0 0
3.30/3.31 c dins : 0.00 0 0
3.30/3.31 c undercover : 0.53 1 0
3.30/3.31 c nlp : 0.00 0 0
3.30/3.31 c trysol : 0.00 0 0
3.30/3.31 c LP : Time Calls Iterations Iter/call Iter/sec
3.30/3.31 c primal LP : 0.01 0 0 0.00 0.00
3.30/3.31 c dual LP : 0.43 1797 5057 2.81 11871.23
3.30/3.31 c lex dual LP : 0.00 0 0 0.00 -
3.30/3.31 c barrier LP : 0.00 0 0 0.00 -
3.30/3.31 c diving/probing LP: 0.10 370 1287 3.48 12257.73
3.30/3.31 c strong branching : 1.08 2080 11259 5.41 10435.01
3.30/3.31 c (at root node) : - 8 149 18.62 -
3.30/3.31 c conflict analysis: 0.00 0 0 0.00 -
3.30/3.31 c B&B Tree :
3.30/3.31 c number of runs : 1
3.30/3.31 c nodes : 957
3.30/3.31 c nodes (total) : 957
3.30/3.31 c nodes left : 0
3.30/3.31 c max depth : 55
3.30/3.31 c max depth (total): 55
3.30/3.31 c backtracks : 104 (10.9%)
3.30/3.31 c delayed cutoffs : 49
3.30/3.31 c repropagations : 288 (674 domain reductions, 48 cutoffs)
3.30/3.31 c avg switch length: 3.47
3.30/3.31 c switching time : 0.06
3.30/3.31 c Solution :
3.30/3.31 c Solutions found : 1 (1 improvements)
3.30/3.31 c First Solution : +3.00000000000000e+00 (in run 1, after 957 nodes, 3.29 seconds, depth 50, found by <relaxation>)
3.30/3.31 c Primal Bound : +3.00000000000000e+00 (in run 1, after 957 nodes, 3.29 seconds, depth 50, found by <relaxation>)
3.30/3.31 c Dual Bound : +3.00000000000000e+00
3.30/3.31 c Gap : 0.00 %
3.30/3.31 c Root Dual Bound : +3.00000000000000e+00
3.30/3.31 c Root Iterations : 414
3.30/3.32 c Time complete: 3.31.