0.00/0.00 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.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-2666189-1276589943.opb>
0.00/0.01 c original problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 99
0.00/0.01 c feasible solution found by trivial heuristic, objective value 9.900000e+01
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.02 c 50 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.2
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.00/0.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c t 0.0s| 1 | 0 | 64 | - | 418k| 0 | 38 | 99 | 50 | 99 | 50 | 0 | 0 | 0 | 7.224851e+00 | 9.900000e+01 |1270.27%
0.00/0.03 o 38
0.00/0.03 c r 0.0s| 1 | 0 | 64 | - | 421k| 0 | 38 | 99 | 50 | 99 | 50 | 0 | 0 | 0 | 7.224851e+00 | 3.800000e+01 | 425.96%
0.00/0.03 o 37
0.00/0.03 c R 0.0s| 1 | 0 | 64 | - | 423k| 0 | 38 | 99 | 50 | 99 | 50 | 0 | 0 | 0 | 7.224851e+00 | 3.700000e+01 | 412.12%
0.00/0.03 o 36
0.00/0.03 c s 0.0s| 1 | 0 | 64 | - | 425k| 0 | 38 | 99 | 50 | 99 | 50 | 0 | 0 | 0 | 7.224851e+00 | 3.600000e+01 | 398.28%
0.00/0.04 c 0.0s| 1 | 0 | 97 | - | 552k| 0 | 37 | 99 | 50 | 99 | 51 | 1 | 0 | 0 | 7.284289e+00 | 3.600000e+01 | 394.21%
0.00/0.04 o 11
0.00/0.04 c b 0.0s| 1 | 0 | 97 | - | 554k| 0 | 37 | 99 | 50 | 99 | 51 | 1 | 0 | 0 | 7.284289e+00 | 1.100000e+01 | 51.01%
0.00/0.05 c 0.0s| 1 | 0 | 121 | - | 688k| 0 | 36 | 99 | 50 | 99 | 52 | 2 | 0 | 0 | 7.313503e+00 | 1.100000e+01 | 50.41%
0.00/0.05 o 10
0.00/0.05 c R 0.0s| 1 | 0 | 121 | - | 691k| 0 | 36 | 99 | 50 | 99 | 52 | 2 | 0 | 0 | 7.313503e+00 | 1.000000e+01 | 36.73%
0.00/0.05 o 10
0.00/0.05 c s 0.0s| 1 | 0 | 121 | - | 692k| 0 | 36 | 99 | 50 | 99 | 52 | 2 | 0 | 0 | 7.313503e+00 | 1.000000e+01 | 36.73%
0.00/0.06 c 0.0s| 1 | 0 | 139 | - | 823k| 0 | 35 | 99 | 50 | 99 | 53 | 3 | 0 | 0 | 7.337576e+00 | 1.000000e+01 | 36.28%
0.00/0.08 c 0.1s| 1 | 0 | 164 | - | 990k| 0 | 34 | 99 | 50 | 99 | 54 | 4 | 0 | 0 | 7.346363e+00 | 1.000000e+01 | 36.12%
0.00/0.09 c 0.1s| 1 | 0 | 182 | - |1137k| 0 | 36 | 99 | 50 | 99 | 55 | 5 | 0 | 0 | 7.353680e+00 | 1.000000e+01 | 35.99%
0.09/0.11 c 0.1s| 1 | 0 | 198 | - |1210k| 0 | 38 | 99 | 50 | 99 | 56 | 6 | 0 | 0 | 7.356776e+00 | 1.000000e+01 | 35.93%
0.09/0.11 o 10
0.09/0.11 c s 0.1s| 1 | 0 | 198 | - |1213k| 0 | 38 | 99 | 50 | 99 | 56 | 6 | 0 | 0 | 7.356776e+00 | 1.000000e+01 | 35.93%
0.09/0.12 c 0.1s| 1 | 0 | 208 | - |1267k| 0 | 37 | 99 | 50 | 99 | 57 | 7 | 0 | 0 | 7.358152e+00 | 1.000000e+01 | 35.90%
0.09/0.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 228 | - |1296k| 0 | 41 | 99 | 50 | 99 | 58 | 8 | 0 | 0 | 7.362257e+00 | 1.000000e+01 | 35.83%
0.09/0.15 c 0.1s| 1 | 0 | 254 | - |1322k| 0 | 41 | 99 | 50 | 99 | 59 | 9 | 0 | 0 | 7.368827e+00 | 1.000000e+01 | 35.71%
0.09/0.17 c 0.1s| 1 | 0 | 271 | - |1326k| 0 | 38 | 99 | 50 | 99 | 60 | 10 | 0 | 0 | 7.373356e+00 | 1.000000e+01 | 35.62%
0.09/0.18 c 0.1s| 1 | 0 | 284 | - |1329k| 0 | 39 | 99 | 50 | 99 | 61 | 11 | 0 | 0 | 7.374894e+00 | 1.000000e+01 | 35.60%
0.09/0.19 c 0.2s| 1 | 0 | 294 | - |1332k| 0 | 41 | 99 | 50 | 99 | 62 | 12 | 0 | 0 | 7.377139e+00 | 1.000000e+01 | 35.55%
0.29/0.33 o 8
0.29/0.33 c E 0.3s| 1 | 0 | 294 | - |1338k| 0 | - | 99 | 50 | 99 | 62 | 12 | 0 | 0 | 7.377139e+00 | 8.000000e+00 | 8.44%
0.29/0.34 c 0.3s| 1 | 0 | 294 | - |1338k| 0 | - | 99 | 50 | 99 | 62 | 12 | 0 | 0 | 8.000000e+00 | 8.000000e+00 | 0.00%
0.29/0.34 c
0.29/0.34 c SCIP Status : problem is solved [optimal solution found]
0.29/0.34 c Solving Time (sec) : 0.29
0.29/0.34 c Solving Nodes : 1
0.29/0.34 c Primal Bound : +8.00000000000000e+00 (30 solutions)
0.29/0.34 c Dual Bound : +8.00000000000000e+00
0.29/0.34 c Gap : 0.00 %
0.29/0.34 s OPTIMUM FOUND
0.29/0.34 v -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74
0.29/0.34 v -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49
0.29/0.34 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 x27 -x26 -x25 -x24
0.29/0.34 v -x23 -x22 x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 -x1
0.29/0.34 c SCIP Status : problem is solved [optimal solution found]
0.29/0.34 c Solving Time : 0.29
0.29/0.34 c Original Problem :
0.29/0.34 c Problem name : HOME/instance-2666189-1276589943.opb
0.29/0.34 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.34 c Constraints : 50 initial, 50 maximal
0.29/0.34 c Presolved Problem :
0.29/0.34 c Problem name : t_HOME/instance-2666189-1276589943.opb
0.29/0.34 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.34 c Constraints : 50 initial, 50 maximal
0.29/0.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.34 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c probing : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c logicor : 0.01 0 0 0 0 0 0 0 0
0.29/0.34 c root node : - 0 - - 0 - - - -
0.29/0.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.34 c integral : 0 0 0 0 0 0 0 0 0 0
0.29/0.34 c logicor : 50 13 89 0 0 0 0 0 0 0
0.29/0.34 c countsols : 0 0 0 0 0 0 0 0 0 0
0.29/0.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.34 c integral : 0.00 0.00 0.00 0.00 0.00
0.29/0.34 c logicor : 0.00 0.00 0.00 0.00 0.00
0.29/0.34 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.34 c Propagators : Time Calls Cutoffs DomReds
0.29/0.34 c vbounds : 0.00 2 0 0
0.29/0.34 c rootredcost : 0.00 0 0 0
0.29/0.34 c pseudoobj : 0.00 14 0 0
0.29/0.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.34 c applied globally : - - - 0 0.0 - - -
0.29/0.34 c applied locally : - - - 0 0.0 - - -
0.29/0.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.34 c cut pool : 0.00 12 - - 77 - (maximal pool size: 281)
0.29/0.34 c redcost : 0.00 13 0 0 0 0
0.29/0.34 c impliedbounds : 0.00 13 0 0 0 0
0.29/0.34 c intobj : 0.00 0 0 0 0 0
0.29/0.34 c cgmip : 0.00 0 0 0 0 0
0.29/0.34 c gomory : 0.06 13 0 0 2 0
0.29/0.34 c strongcg : 0.04 13 0 0 279 0
0.29/0.34 c cmir : 0.01 10 0 0 0 0
0.29/0.34 c flowcover : 0.03 10 0 0 0 0
0.29/0.34 c clique : 0.00 1 0 0 0 0
0.29/0.34 c zerohalf : 0.00 0 0 0 0 0
0.29/0.34 c mcf : 0.00 1 0 0 0 0
0.29/0.34 c rapidlearning : 0.00 0 0 0 0 0
0.29/0.34 c Pricers : Time Calls Vars
0.29/0.34 c problem variables: 0.00 0 0
0.29/0.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.34 c pscost : 0.00 0 0 0 0 0 0
0.29/0.34 c inference : 0.00 0 0 0 0 0 0
0.29/0.34 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.34 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.34 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.34 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.34 c random : 0.00 0 0 0 0 0 0
0.29/0.34 c relpscost : 0.00 0 0 0 0 0 0
0.29/0.34 c Primal Heuristics : Time Calls Found
0.29/0.34 c LP solutions : 0.00 - 0
0.29/0.34 c pseudo solutions : 0.00 - 0
0.29/0.34 c crossover : 0.00 0 0
0.29/0.34 c oneopt : 0.00 3 1
0.29/0.34 c trivial : 0.00 2 3
0.29/0.34 c simplerounding : 0.00 13 13
0.29/0.34 c zirounding : 0.00 1 1
0.29/0.34 c rounding : 0.00 13 2
0.29/0.34 c shifting : 0.01 13 9
0.29/0.34 c intshifting : 0.00 0 0
0.29/0.34 c twoopt : 0.00 0 0
0.29/0.34 c fixandinfer : 0.00 0 0
0.29/0.34 c feaspump : 0.00 0 0
0.29/0.34 c coefdiving : 0.00 0 0
0.29/0.34 c pscostdiving : 0.00 0 0
0.29/0.34 c fracdiving : 0.00 0 0
0.29/0.34 c veclendiving : 0.00 0 0
0.29/0.34 c intdiving : 0.00 0 0
0.29/0.34 c actconsdiving : 0.00 0 0
0.29/0.34 c objpscostdiving : 0.00 0 0
0.29/0.34 c rootsoldiving : 0.00 0 0
0.29/0.34 c linesearchdiving : 0.00 0 0
0.29/0.34 c guideddiving : 0.00 0 0
0.29/0.34 c octane : 0.00 0 0
0.29/0.34 c rens : 0.12 1 1
0.29/0.34 c rins : 0.00 0 0
0.29/0.34 c localbranching : 0.00 0 0
0.29/0.34 c mutation : 0.00 0 0
0.29/0.34 c dins : 0.00 0 0
0.29/0.34 c undercover : 0.00 0 0
0.29/0.34 c nlp : 0.00 0 0
0.29/0.34 c trysol : 0.00 0 0
0.29/0.34 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.34 c primal LP : 0.00 0 0 0.00 -
0.29/0.34 c dual LP : 0.01 13 294 22.62 29400.00
0.29/0.34 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.34 c barrier LP : 0.00 0 0 0.00 -
0.29/0.34 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.34 c strong branching : 0.00 0 0 0.00 -
0.29/0.34 c (at root node) : - 0 0 0.00 -
0.29/0.34 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.34 c B&B Tree :
0.29/0.34 c number of runs : 1
0.29/0.34 c nodes : 1
0.29/0.34 c nodes (total) : 1
0.29/0.34 c nodes left : 0
0.29/0.34 c max depth : 0
0.29/0.34 c max depth (total): 0
0.29/0.34 c backtracks : 0 (0.0%)
0.29/0.34 c delayed cutoffs : 0
0.29/0.34 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.34 c avg switch length: 2.00
0.29/0.34 c switching time : 0.00
0.29/0.34 c Solution :
0.29/0.34 c Solutions found : 30 (9 improvements)
0.29/0.34 c First Solution : +9.90000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.29/0.34 c Primal Bound : +8.00000000000000e+00 (in run 1, after 1 nodes, 0.28 seconds, depth 0, found by <rens>)
0.29/0.34 c Dual Bound : +8.00000000000000e+00
0.29/0.34 c Gap : 0.00 %
0.29/0.34 c Root Dual Bound : +8.00000000000000e+00
0.29/0.34 c Root Iterations : 294
0.29/0.35 c Time complete: 0.34.