0.00/0.01 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.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2666145-1276474776.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.00/0.08 c (round 1) 0 del vars, 20 del conss, 0 chg bounds, 20 chg sides, 0 chg coeffs, 880 upgd conss, 656 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 0 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.09/0.11 c 1008 implications, 0 cliques
0.09/0.11 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 880 constraints
0.09/0.11 c 880 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.07
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.2
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1799.98
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = 0
0.09/0.11 c
0.09/0.11 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.19/0.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.29 c 0.2s| 1 | 0 | 721 | - |1849k| 0 | 189 | 200 | 880 | 200 | 880 | 0 | 0 | 0 | 6.848444e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 871 | - |4005k| 0 | 186 | 200 | 880 | 200 | 889 | 9 | 0 | 0 | 6.890800e+01 | -- | Inf
0.79/0.80 c 0.7s| 1 | 0 | 950 | - |6205k| 0 | 186 | 200 | 880 | 200 | 890 | 10 | 0 | 0 | 6.903715e+01 | -- | Inf
0.99/1.06 c 1.0s| 1 | 0 | 1010 | - |8724k| 0 | 186 | 200 | 880 | 200 | 891 | 11 | 0 | 0 | 6.907446e+01 | -- | Inf
1.28/1.33 c 1.3s| 1 | 0 | 1095 | - | 11M| 0 | 186 | 200 | 880 | 200 | 892 | 12 | 0 | 0 | 6.909910e+01 | -- | Inf
1.59/1.60 c 1.5s| 1 | 0 | 1173 | - | 13M| 0 | 186 | 200 | 880 | 200 | 893 | 13 | 0 | 0 | 6.911333e+01 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 1233 | - | 16M| 0 | 187 | 200 | 880 | 200 | 894 | 14 | 0 | 0 | 6.913042e+01 | -- | Inf
2.10/2.18 c 2.1s| 1 | 0 | 1290 | - | 19M| 0 | 186 | 200 | 880 | 200 | 895 | 15 | 0 | 0 | 6.913680e+01 | -- | Inf
2.49/2.51 c 2.4s| 1 | 0 | 1343 | - | 21M| 0 | 186 | 200 | 880 | 200 | 896 | 16 | 0 | 0 | 6.914330e+01 | -- | Inf
2.79/2.83 c 2.8s| 1 | 0 | 1410 | - | 22M| 0 | 187 | 200 | 880 | 200 | 897 | 17 | 0 | 0 | 6.914616e+01 | -- | Inf
3.09/3.15 c 3.0s| 1 | 0 | 1501 | - | 22M| 0 | 189 | 200 | 880 | 200 | 898 | 18 | 0 | 0 | 6.915185e+01 | -- | Inf
3.38/3.44 c 3.3s| 1 | 0 | 1553 | - | 22M| 0 | 189 | 200 | 880 | 200 | 894 | 19 | 0 | 0 | 6.915723e+01 | -- | Inf
3.68/3.72 c 3.6s| 1 | 0 | 1577 | - | 22M| 0 | 187 | 200 | 880 | 200 | 895 | 20 | 0 | 0 | 6.915902e+01 | -- | Inf
3.99/4.03 c 3.9s| 1 | 0 | 1649 | - | 22M| 0 | 187 | 200 | 880 | 200 | 896 | 21 | 0 | 0 | 6.917530e+01 | -- | Inf
4.30/4.30 c 4.2s| 1 | 0 | 1687 | - | 23M| 0 | 188 | 200 | 880 | 200 | 897 | 22 | 0 | 0 | 6.917843e+01 | -- | Inf
6.98/7.00 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
6.98/7.00 c 6.9s| 1 | 2 | 1687 | - | 23M| 0 | 188 | 200 | 880 | 200 | 897 | 22 | 0 | 17 | 6.917843e+01 | -- | Inf
6.98/7.05 o 95
6.98/7.05 c * 6.9s| 104 | 7 | 1687 | 0.0 | 23M| 24 | - | 200 | 902 | 0 | 0 | 22 | 54 | 17 | 7.044929e+01 | 9.500000e+01 | 34.85%
7.09/7.13 o 94
7.09/7.13 c * 7.0s| 278 | 8 | 1687 | 0.0 | 23M| 24 | - | 200 | 896 | 0 | 0 | 22 | 151 | 17 | 7.044929e+01 | 9.400000e+01 | 33.43%
7.09/7.18 o 93
7.09/7.18 c * 7.0s| 381 | 8 | 1687 | 0.0 | 23M| 24 | - | 200 | 884 | 0 | 0 | 22 | 199 | 17 | 7.044929e+01 | 9.300000e+01 | 32.01%
7.38/7.43 c
7.38/7.43 c SCIP Status : problem is solved [optimal solution found]
7.38/7.43 c Solving Time (sec) : 7.24
7.38/7.43 c Solving Nodes : 819
7.38/7.43 c Primal Bound : +9.30000000000000e+01 (3 solutions)
7.38/7.43 c Dual Bound : +9.30000000000000e+01
7.38/7.43 c Gap : 0.00 %
7.38/7.43 s OPTIMUM FOUND
7.38/7.43 v x200 -x199 x198 -x197 -x196 x195 -x194 x193 -x192 x191 x190 -x189 -x188 x187 -x186 x185 -x184 x183 -x182 x181 -x180 x179 -x178
7.38/7.43 v x177 -x176 x175 -x174 -x173 x172 -x171 x170 -x169 x168 -x167 x166 -x165 -x164 x163 -x162 x161 x160 -x159 x158 -x157 -x156 x155
7.38/7.43 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 -x146 x145 x144 -x143 x142 -x141 -x140 x139 x138 -x137 -x136 x135 -x134 x133 -x132
7.38/7.43 v x131 x130 -x129 x128 -x127 x126 -x125 -x124 x123 -x122 x121 x120 -x119 x118 -x117 -x116 x115 -x114 x113 -x112 x111 -x110
7.38/7.43 v x109 x108 -x107 x106 -x105 -x104 -x103 -x102 x101 -x100 -x99 x98 -x97 -x96 x95 -x94 x93 x92 -x91 x90 -x89 -x88 x87 x86 -x85 -x84
7.38/7.43 v x83 -x82 x81 -x80 x79 x78 -x77 x76 -x75 -x74 x73 -x72 x71 -x70 -x69 -x68 x67 -x66 x65 x64 -x63 x62 -x61 x60 -x59 -x58 x57
7.38/7.43 v x56 -x55 x54 -x53 -x52 x51 -x50 x49 -x48 x47 x46 -x45 -x44 -x43 x42 -x41 x40 -x39 x38 -x37 x36 -x35 x34 -x33 -x32 x31 -x30 x29
7.38/7.43 v -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 x3 x2 -x1
7.38/7.43 c SCIP Status : problem is solved [optimal solution found]
7.38/7.43 c Solving Time : 7.24
7.38/7.43 c Original Problem :
7.38/7.43 c Problem name : HOME/instance-2666145-1276474776.opb
7.38/7.43 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
7.38/7.43 c Constraints : 900 initial, 900 maximal
7.38/7.43 c Presolved Problem :
7.38/7.43 c Problem name : t_HOME/instance-2666145-1276474776.opb
7.38/7.43 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
7.38/7.43 c Constraints : 880 initial, 907 maximal
7.38/7.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.38/7.43 c trivial : 0.00 0 0 0 0 0 0 0 0
7.38/7.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.38/7.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.38/7.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.38/7.43 c implics : 0.00 0 0 0 0 0 0 0 0
7.38/7.43 c probing : 0.02 0 0 0 0 0 0 0 0
7.38/7.43 c linear : 0.03 0 0 0 0 0 20 20 0
7.38/7.43 c logicor : 0.02 0 0 0 0 0 0 0 0
7.38/7.43 c root node : - 131 - - 131 - - - -
7.38/7.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.38/7.43 c integral : 0 0 0 1 0 0 0 0 0 2
7.38/7.43 c logicor : 880+ 15 9402 0 3 446 25120 0 0 0
7.38/7.43 c countsols : 0 0 0 0 3 0 0 0 0 0
7.38/7.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.38/7.43 c integral : 2.39 0.00 0.00 2.39 0.00
7.38/7.43 c logicor : 0.15 0.00 0.15 0.00 0.00
7.38/7.43 c countsols : 0.00 0.00 0.00 0.00 0.00
7.38/7.43 c Propagators : Time Calls Cutoffs DomReds
7.38/7.43 c vbounds : 0.00 2 0 0
7.38/7.43 c rootredcost : 0.00 3 0 0
7.38/7.43 c pseudoobj : 0.11 9481 17 201
7.38/7.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.38/7.43 c propagation : 0.01 446 421 421 6.2 40 7.0 -
7.38/7.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
7.38/7.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.38/7.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.38/7.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.38/7.43 c applied globally : - - - 461 6.2 - - -
7.38/7.43 c applied locally : - - - 0 0.0 - - -
7.38/7.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.38/7.43 c cut pool : 0.08 14 - - 498 - (maximal pool size: 4107)
7.38/7.43 c redcost : 0.00 15 0 0 0 0
7.38/7.43 c impliedbounds : 0.00 15 0 0 16 0
7.38/7.43 c intobj : 0.00 0 0 0 0 0
7.38/7.43 c cgmip : 0.00 0 0 0 0 0
7.38/7.43 c gomory : 1.95 15 0 0 0 0
7.38/7.43 c strongcg : 1.70 15 0 0 4355 0
7.38/7.43 c cmir : 0.05 10 0 0 0 0
7.38/7.43 c flowcover : 0.11 10 0 0 0 0
7.38/7.43 c clique : 0.00 1 0 0 0 0
7.38/7.43 c zerohalf : 0.00 0 0 0 0 0
7.38/7.43 c mcf : 0.00 1 0 0 0 0
7.38/7.43 c rapidlearning : 0.00 0 0 0 0 0
7.38/7.43 c Pricers : Time Calls Vars
7.38/7.43 c problem variables: 0.00 0 0
7.38/7.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.38/7.43 c relpscost : 2.39 1 0 0 0 0 2
7.38/7.43 c pscost : 0.00 0 0 0 0 0 0
7.38/7.43 c inference : 0.01 534 0 0 0 0 1068
7.38/7.43 c mostinf : 0.00 0 0 0 0 0 0
7.38/7.43 c leastinf : 0.00 0 0 0 0 0 0
7.38/7.43 c fullstrong : 0.00 0 0 0 0 0 0
7.38/7.43 c allfullstrong : 0.00 0 0 0 0 0 0
7.38/7.43 c random : 0.00 0 0 0 0 0 0
7.38/7.43 c Primal Heuristics : Time Calls Found
7.38/7.43 c LP solutions : 0.00 - 0
7.38/7.43 c pseudo solutions : 0.00 - 3
7.38/7.43 c oneopt : 0.00 0 0
7.38/7.43 c crossover : 0.00 0 0
7.38/7.43 c trivial : 0.00 2 0
7.38/7.43 c simplerounding : 0.00 0 0
7.38/7.43 c zirounding : 0.00 1 0
7.38/7.43 c rounding : 0.01 15 0
7.38/7.43 c shifting : 0.01 15 0
7.38/7.43 c intshifting : 0.00 0 0
7.38/7.43 c twoopt : 0.00 0 0
7.38/7.43 c fixandinfer : 0.00 0 0
7.38/7.43 c feaspump : 0.01 1 0
7.38/7.43 c coefdiving : 0.00 0 0
7.38/7.43 c pscostdiving : 0.00 0 0
7.38/7.43 c fracdiving : 0.00 0 0
7.38/7.43 c veclendiving : 0.00 0 0
7.38/7.43 c intdiving : 0.00 0 0
7.38/7.43 c actconsdiving : 0.00 0 0
7.38/7.43 c objpscostdiving : 0.00 0 0
7.38/7.43 c rootsoldiving : 0.00 0 0
7.38/7.43 c linesearchdiving : 0.00 0 0
7.38/7.43 c guideddiving : 0.00 0 0
7.38/7.43 c octane : 0.00 0 0
7.38/7.43 c rens : 0.00 0 0
7.38/7.43 c rins : 0.00 0 0
7.38/7.43 c localbranching : 0.00 0 0
7.38/7.43 c mutation : 0.00 0 0
7.38/7.43 c dins : 0.00 0 0
7.38/7.43 c undercover : 0.00 0 0
7.38/7.43 c nlp : 0.00 0 0
7.38/7.43 c trysol : 0.00 0 0
7.38/7.43 c LP : Time Calls Iterations Iter/call Iter/sec
7.38/7.43 c primal LP : 0.00 0 0 0.00 -
7.38/7.43 c dual LP : 0.47 15 1687 112.47 3589.36
7.38/7.43 c lex dual LP : 0.00 0 0 0.00 -
7.38/7.43 c barrier LP : 0.00 0 0 0.00 -
7.38/7.43 c diving/probing LP: 0.00 0 0 0.00 -
7.38/7.43 c strong branching : 2.39 17 9681 569.47 4050.63
7.38/7.43 c (at root node) : - 17 9681 569.47 -
7.38/7.43 c conflict analysis: 0.00 0 0 0.00 -
7.38/7.43 c B&B Tree :
7.38/7.43 c number of runs : 1
7.38/7.43 c nodes : 819
7.38/7.43 c nodes (total) : 819
7.38/7.43 c nodes left : 0
7.38/7.43 c max depth : 24
7.38/7.43 c max depth (total): 24
7.38/7.43 c backtracks : 216 (26.4%)
7.38/7.43 c delayed cutoffs : 240
7.38/7.43 c repropagations : 643 (11265 domain reductions, 182 cutoffs)
7.38/7.43 c avg switch length: 2.64
7.38/7.43 c switching time : 0.04
7.38/7.43 c Solution :
7.38/7.43 c Solutions found : 3 (3 improvements)
7.38/7.43 c First Solution : +9.50000000000000e+01 (in run 1, after 104 nodes, 6.91 seconds, depth 24, found by <relaxation>)
7.38/7.43 c Primal Bound : +9.30000000000000e+01 (in run 1, after 381 nodes, 7.02 seconds, depth 14, found by <relaxation>)
7.38/7.43 c Dual Bound : +9.30000000000000e+01
7.38/7.43 c Gap : 0.00 %
7.38/7.43 c Root Dual Bound : +6.91784281158501e+01
7.38/7.43 c Root Iterations : 1687
7.38/7.44 c Time complete: 7.43.