0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664806-1276620905.opb>
0.00/0.02 c original problem has 139 variables (139 bin, 0 int, 0 impl, 0 cont) and 216 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 1 del vars, 1 del conss, 1 chg bounds, 14 chg sides, 41 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (round 2) 1 del vars, 82 del conss, 1 chg bounds, 14 chg sides, 41 chg coeffs, 29 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (round 3) 1 del vars, 82 del conss, 1 chg bounds, 24 chg sides, 99 chg coeffs, 53 upgd conss, 98 impls, 1 clqs
0.00/0.04 c (round 4) 1 del vars, 82 del conss, 1 chg bounds, 24 chg sides, 106 chg coeffs, 53 upgd conss, 98 impls, 1 clqs
0.06/0.07 c (0.1s) probing: 135/138 (97.8%) - 0 fixings, 0 aggregations, 43 implications, 0 bound changes
0.06/0.07 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.06/0.07 c presolving (5 rounds):
0.06/0.07 c 1 deleted vars, 82 deleted constraints, 1 tightened bounds, 0 added holes, 24 changed sides, 106 changed coefficients
0.06/0.07 c 184 implications, 1 cliques
0.06/0.07 c presolved problem has 138 variables (138 bin, 0 int, 0 impl, 0 cont) and 134 constraints
0.06/0.07 c 53 constraints of type <knapsack>
0.06/0.07 c 81 constraints of type <linear>
0.06/0.07 c transformed objective value is always integral (scale: 1)
0.06/0.07 c Presolving Time: 0.04
0.06/0.07 c - non default parameters ----------------------------------------------------------------------
0.06/0.07 c # SCIP version 1.2.1.2
0.06/0.07 c
0.06/0.07 c # frequency for displaying node information lines
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.07 c display/freq = 10000
0.06/0.07 c
0.06/0.07 c # maximal time in seconds to run
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/time = 1799.99
0.06/0.07 c
0.06/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/memory = 1620
0.06/0.07 c
0.06/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c lp/solvefreq = -1
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify inequalities
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/linear/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify knapsacks
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c separating/rapidlearning/freq = 0
0.06/0.07 c
0.06/0.07 c -----------------------------------------------------------------------------------------------
0.06/0.07 c start solving
0.06/0.08 c
0.06/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.08 c 0.1s| 1 | 2 | 0 | - | 828k| 0 | - | 138 | 134 | 0 | 0 | 0 | 0 | 0 | 1.500000e+01 | -- | Inf
0.09/0.17 o 31
0.09/0.17 c * 0.1s| 208 | 123 | 0 | 0.0 | 942k| 35 | - | 138 | 205 | 0 | 0 | 0 | 71 | 0 | 1.500000e+01 | 3.100000e+01 | 106.67%
0.09/0.17 o 30
0.09/0.17 c * 0.1s| 210 | 123 | 0 | 0.0 | 945k| 35 | - | 138 | 205 | 0 | 0 | 0 | 71 | 0 | 1.500000e+01 | 3.000000e+01 | 100.00%
0.19/0.20 o 23
0.19/0.20 c * 0.2s| 274 | 143 | 0 | 0.0 | 958k| 35 | - | 138 | 215 | 0 | 0 | 0 | 81 | 0 | 1.500000e+01 | 2.300000e+01 | 53.33%
0.19/0.21 o 22
0.19/0.21 c * 0.2s| 301 | 157 | 0 | 0.0 | 979k| 35 | - | 138 | 224 | 0 | 0 | 0 | 90 | 0 | 1.500000e+01 | 2.200000e+01 | 46.67%
0.19/0.25 o 21
0.19/0.25 c * 0.2s| 352 | 172 | 0 | 0.0 |1004k| 35 | - | 138 | 249 | 0 | 0 | 0 | 119 | 0 | 1.500000e+01 | 2.100000e+01 | 40.00%
0.39/0.45 o 18
0.39/0.45 c * 0.4s| 623 | 166 | 0 | 0.0 |1146k| 35 | - | 138 | 448 | 0 | 0 | 0 | 318 | 0 | 1.500000e+01 | 1.800000e+01 | 20.00%
0.69/0.73 o 17
0.69/0.73 c * 0.7s| 967 | 106 | 0 | 0.0 |1288k| 35 | - | 138 | 753 | 0 | 0 | 0 | 668 | 0 | 1.500000e+01 | 1.700000e+01 | 13.33%
0.79/0.90 c
0.79/0.90 c SCIP Status : problem is solved [optimal solution found]
0.79/0.90 c Solving Time (sec) : 0.84
0.79/0.90 c Solving Nodes : 1076
0.79/0.90 c Primal Bound : +1.70000000000000e+01 (7 solutions)
0.79/0.90 c Dual Bound : +1.70000000000000e+01
0.79/0.90 c Gap : 0.00 %
0.79/0.90 s OPTIMUM FOUND
0.79/0.90 v x34 x35 x36 x37 x38 x39 x40 x41 x42 x43 x44 x45 x46 x47 x48 x49 x50 x51 x52 x53 x54 x55 x56 x57 x58 x59 x60 x61 x62 x63 x64 x65
0.79/0.90 v x66 x67 x68 x69 x70 x71 -x72 x73 x74 x75 x76 x77 x78 -x79 x80 -x81 -x82 -x83 x84 x85 x86 -x87 -x88 x89 x90 x91 x92 x93 x94 x95
0.79/0.90 v x96 x97 x98 x99 x100 x101 x102 x103 x104 -x105 x106 x107 x108 x109 -x110 x111 -x112 -x113 -x114 x115 x116 -x117 -x118 -x17
0.79/0.90 v -x16 -x15 -x14 -x13 -x12 x119 x120 x121 -x122 x123 x124 -x125 x126 -x127 -x128 -x129 x130 -x131 -x132 -x11 -x10 -x9 -x8 -x7
0.79/0.90 v -x6 -x133 x134 -x135 -x136 -x137 -x23 -x22 -x21 -x20 -x19 x18 x138 -x33 -x32 -x31 x30 -x29 -x28 -x27 x26 -x25 -x24 x139 -x5 -x4
0.79/0.90 v -x3 x2 -x1
0.79/0.90 c SCIP Status : problem is solved [optimal solution found]
0.79/0.90 c Solving Time : 0.84
0.79/0.90 c Original Problem :
0.79/0.90 c Problem name : HOME/instance-2664806-1276620905.opb
0.79/0.90 c Variables : 139 (139 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.90 c Constraints : 216 initial, 216 maximal
0.79/0.90 c Presolved Problem :
0.79/0.90 c Problem name : t_HOME/instance-2664806-1276620905.opb
0.79/0.90 c Variables : 138 (138 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.90 c Constraints : 134 initial, 941 maximal
0.79/0.90 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.90 c trivial : 0.00 0 0 0 0 0 0 0 0
0.79/0.90 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.90 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.90 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.90 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.90 c probing : 0.03 0 0 0 0 0 0 0 0
0.79/0.90 c knapsack : 0.01 0 0 0 0 0 0 10 65
0.79/0.90 c linear : 0.00 1 0 0 1 0 82 14 41
0.79/0.90 c logicor : 0.00 0 0 0 0 0 0 0 0
0.79/0.90 c root node : - 12 - - 12 - - - -
0.79/0.90 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.90 c integral : 0 0 0 0 0 0 0 0 0 0
0.79/0.90 c knapsack : 53 0 4348 0 786 100 5533 0 0 0
0.79/0.90 c linear : 81 0 4239 0 780 384 14235 0 0 0
0.79/0.90 c logicor : 0+ 0 1869 0 0 27 865 0 0 0
0.79/0.90 c countsols : 0 0 0 0 786 0 0 0 0 0
0.79/0.90 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.90 c integral : 0.00 0.00 0.00 0.00 0.00
0.79/0.90 c knapsack : 0.16 0.00 0.13 0.00 0.03
0.79/0.90 c linear : 0.50 0.00 0.49 0.00 0.01
0.79/0.90 c logicor : 0.03 0.00 0.03 0.00 0.00
0.79/0.90 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.90 c Propagators : Time Calls Cutoffs DomReds
0.79/0.90 c vbounds : 0.00 2 0 0
0.79/0.90 c rootredcost : 0.00 0 0 0
0.79/0.90 c pseudoobj : 0.01 4086 10 131
0.79/0.90 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.90 c propagation : 0.02 521 521 2117 11.6 6 11.0 -
0.79/0.90 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.90 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.90 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.90 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.90 c applied globally : - - - 857 10.4 - - -
0.79/0.90 c applied locally : - - - 0 0.0 - - -
0.79/0.90 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.90 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.79/0.90 c redcost : 0.00 0 0 0 0 0
0.79/0.90 c impliedbounds : 0.00 0 0 0 0 0
0.79/0.90 c intobj : 0.00 0 0 0 0 0
0.79/0.90 c cgmip : 0.00 0 0 0 0 0
0.79/0.90 c gomory : 0.00 0 0 0 0 0
0.79/0.90 c strongcg : 0.00 0 0 0 0 0
0.79/0.90 c cmir : 0.00 0 0 0 0 0
0.79/0.90 c flowcover : 0.00 0 0 0 0 0
0.79/0.90 c clique : 0.00 0 0 0 0 0
0.79/0.90 c zerohalf : 0.00 0 0 0 0 0
0.79/0.90 c mcf : 0.00 0 0 0 0 0
0.79/0.90 c rapidlearning : 0.00 0 0 0 0 0
0.79/0.90 c Pricers : Time Calls Vars
0.79/0.90 c problem variables: 0.00 0 0
0.79/0.90 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.90 c relpscost : 0.00 0 0 0 0 0 0
0.79/0.90 c pscost : 0.00 0 0 0 0 0 0
0.79/0.90 c inference : 0.01 779 0 0 0 0 1558
0.79/0.90 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.90 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.90 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.90 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.90 c random : 0.00 0 0 0 0 0 0
0.79/0.90 c Primal Heuristics : Time Calls Found
0.79/0.90 c LP solutions : 0.00 - 0
0.79/0.90 c pseudo solutions : 0.00 - 7
0.79/0.90 c oneopt : 0.00 0 0
0.79/0.90 c trivial : 0.00 2 0
0.79/0.90 c simplerounding : 0.00 0 0
0.79/0.90 c zirounding : 0.00 0 0
0.79/0.90 c rounding : 0.00 0 0
0.79/0.90 c shifting : 0.00 0 0
0.79/0.90 c intshifting : 0.00 0 0
0.79/0.90 c twoopt : 0.00 0 0
0.79/0.90 c fixandinfer : 0.00 0 0
0.79/0.90 c feaspump : 0.00 0 0
0.79/0.90 c coefdiving : 0.00 0 0
0.79/0.90 c pscostdiving : 0.00 0 0
0.79/0.90 c fracdiving : 0.00 0 0
0.79/0.90 c veclendiving : 0.00 0 0
0.79/0.90 c intdiving : 0.00 0 0
0.79/0.90 c actconsdiving : 0.00 0 0
0.79/0.90 c objpscostdiving : 0.00 0 0
0.79/0.90 c rootsoldiving : 0.00 0 0
0.79/0.90 c linesearchdiving : 0.00 0 0
0.79/0.90 c guideddiving : 0.00 0 0
0.79/0.90 c octane : 0.00 0 0
0.79/0.90 c rens : 0.00 0 0
0.79/0.90 c rins : 0.00 0 0
0.79/0.90 c localbranching : 0.00 0 0
0.79/0.90 c mutation : 0.00 0 0
0.79/0.90 c crossover : 0.00 0 0
0.79/0.90 c dins : 0.00 0 0
0.79/0.90 c undercover : 0.00 0 0
0.79/0.90 c nlp : 0.00 0 0
0.79/0.90 c trysol : 0.00 0 0
0.79/0.90 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.90 c primal LP : 0.00 0 0 0.00 -
0.79/0.90 c dual LP : 0.00 0 0 0.00 -
0.79/0.90 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.90 c barrier LP : 0.00 0 0 0.00 -
0.79/0.90 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.90 c strong branching : 0.00 0 0 0.00 -
0.79/0.90 c (at root node) : - 0 0 0.00 -
0.79/0.90 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.90 c B&B Tree :
0.79/0.90 c number of runs : 1
0.79/0.90 c nodes : 1076
0.79/0.90 c nodes (total) : 1076
0.79/0.90 c nodes left : 0
0.79/0.90 c max depth : 35
0.79/0.90 c max depth (total): 35
0.79/0.90 c backtracks : 355 (33.0%)
0.79/0.90 c delayed cutoffs : 389
0.79/0.90 c repropagations : 1220 (7923 domain reductions, 231 cutoffs)
0.79/0.90 c avg switch length: 6.72
0.79/0.90 c switching time : 0.08
0.79/0.90 c Solution :
0.79/0.90 c Solutions found : 7 (7 improvements)
0.79/0.90 c First Solution : +3.10000000000000e+01 (in run 1, after 208 nodes, 0.15 seconds, depth 17, found by <relaxation>)
0.79/0.90 c Primal Bound : +1.70000000000000e+01 (in run 1, after 967 nodes, 0.68 seconds, depth 20, found by <relaxation>)
0.79/0.90 c Dual Bound : +1.70000000000000e+01
0.79/0.90 c Gap : 0.00 %
0.79/0.90 c Root Dual Bound : +1.50000000000000e+01
0.79/0.90 c Root Iterations : 0
0.89/0.90 c Time complete: 0.9.