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-2666219-1276595308.opb>
0.00/0.01 c original problem has 100 variables (100 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 100
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.000000e+02
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 100 variables (100 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 | 94 | - | 519k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 1.000000e+02 |3355.55%
0.00/0.03 o 39
0.00/0.03 c r 0.0s| 1 | 0 | 94 | - | 522k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 3.900000e+01 |1247.66%
0.00/0.03 o 38
0.00/0.03 c R 0.0s| 1 | 0 | 94 | - | 525k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 3.800000e+01 |1213.11%
0.00/0.03 o 37
0.00/0.03 c s 0.0s| 1 | 0 | 94 | - | 528k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 3.700000e+01 |1178.55%
0.00/0.04 c 0.0s| 1 | 0 | 142 | - | 618k| 0 | 37 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.928411e+00 | 3.700000e+01 |1163.48%
0.00/0.04 o 7
0.00/0.04 c b 0.0s| 1 | 0 | 142 | - | 621k| 0 | 37 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.928411e+00 | 7.000000e+00 | 139.04%
0.00/0.05 c 0.0s| 1 | 0 | 177 | - | 699k| 0 | 34 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.954940e+00 | 7.000000e+00 | 136.89%
0.06/0.07 c 0.1s| 1 | 0 | 200 | - | 753k| 0 | 34 | 100 | 50 | 100 | 53 | 3 | 0 | 0 | 2.959985e+00 | 7.000000e+00 | 136.49%
0.06/0.08 c 0.1s| 1 | 0 | 228 | - | 766k| 0 | 32 | 100 | 50 | 100 | 54 | 4 | 0 | 0 | 2.970470e+00 | 7.000000e+00 | 135.65%
0.06/0.10 c 0.1s| 1 | 0 | 250 | - | 773k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 7.000000e+00 | 135.19%
0.19/0.28 o 4
0.19/0.28 c E 0.2s| 1 | 0 | 250 | - | 778k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.19/0.28 c 0.2s| 1 | 0 | 250 | - | 778k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.29/0.30 c 0.2s| 1 | 0 | 250 | - | 778k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.29/0.32 c 0.3s| 1 | 0 | 250 | - | 778k| 0 | - | 100 | 50 | 100 | 55 | 5 | 0 | 5 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.29/0.32 c (run 1, node 1) restarting after 57 global fixings of integer variables
0.29/0.32 c
0.29/0.32 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.29/0.32 c
0.29/0.32 c presolving:
0.29/0.33 c (round 1) 57 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 0 impls, 0 clqs
0.29/0.33 c presolving (2 rounds):
0.29/0.33 c 57 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.33 c 0 implications, 0 cliques
0.29/0.33 c presolved problem has 43 variables (43 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.29/0.33 c 5 constraints of type <knapsack>
0.29/0.33 c 50 constraints of type <logicor>
0.29/0.33 c transformed objective value is always integral (scale: 1)
0.29/0.33 c Presolving Time: 0.02
0.29/0.33 c
0.29/0.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.33 c 0.3s| 1 | 0 | 340 | - | 553k| 0 | - | 43 | 55 | 43 | 55 | 0 | 0 | 5 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.29/0.33 c 0.3s| 1 | 0 | 340 | - | 553k| 0 | - | 43 | 55 | 43 | 55 | 0 | 0 | 5 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.29/0.33 c
0.29/0.33 c SCIP Status : problem is solved [optimal solution found]
0.29/0.33 c Solving Time (sec) : 0.27
0.29/0.33 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.29/0.33 c Primal Bound : +4.00000000000000e+00 (15 solutions)
0.29/0.33 c Dual Bound : +4.00000000000000e+00
0.29/0.33 c Gap : 0.00 %
0.29/0.33 s OPTIMUM FOUND
0.29/0.33 v -x100 -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
0.29/0.33 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
0.29/0.33 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31 -x30 -x29 x28 -x27 -x26 -x25
0.29/0.33 v -x24 -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.33 c SCIP Status : problem is solved [optimal solution found]
0.29/0.33 c Solving Time : 0.27
0.29/0.33 c Original Problem :
0.29/0.33 c Problem name : HOME/instance-2666219-1276595308.opb
0.29/0.33 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33 c Constraints : 50 initial, 50 maximal
0.29/0.33 c Presolved Problem :
0.29/0.33 c Problem name : t_HOME/instance-2666219-1276595308.opb
0.29/0.33 c Variables : 43 (43 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33 c Constraints : 55 initial, 55 maximal
0.29/0.33 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.33 c trivial : 0.00 57 0 0 0 0 0 0 0
0.29/0.33 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c probing : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c logicor : 0.01 0 0 0 0 0 0 0 0
0.29/0.33 c root node : - 57 - - 57 - - - -
0.29/0.33 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.33 c integral : 0 0 0 1 0 0 5 0 0 0
0.29/0.33 c knapsack : 5 0 1 0 0 0 0 0 0 0
0.29/0.33 c logicor : 50 7 57 0 0 0 0 0 0 0
0.29/0.33 c countsols : 0 0 0 0 0 0 0 0 0 0
0.29/0.33 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.33 c integral : 0.02 0.00 0.00 0.02 0.00
0.29/0.33 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c logicor : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c Propagators : Time Calls Cutoffs DomReds
0.29/0.33 c vbounds : 0.00 3 0 0
0.29/0.33 c rootredcost : 0.00 0 0 0
0.29/0.33 c pseudoobj : 0.00 11 1 0
0.29/0.33 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.33 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.33 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.33 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.33 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.33 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.33 c applied globally : - - - 0 0.0 - - -
0.29/0.33 c applied locally : - - - 0 0.0 - - -
0.29/0.33 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.33 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.29/0.33 c redcost : 0.00 7 0 52 0 0
0.29/0.33 c impliedbounds : 0.00 7 0 0 0 0
0.29/0.33 c intobj : 0.00 0 0 0 0 0
0.29/0.33 c cgmip : 0.00 0 0 0 0 0
0.29/0.33 c gomory : 0.02 7 0 0 0 0
0.29/0.33 c strongcg : 0.02 7 0 0 74 0
0.29/0.33 c cmir : 0.01 7 0 0 0 0
0.29/0.33 c flowcover : 0.02 7 0 0 0 0
0.29/0.33 c clique : 0.00 1 0 0 0 0
0.29/0.33 c zerohalf : 0.00 0 0 0 0 0
0.29/0.33 c mcf : 0.00 1 0 0 0 0
0.29/0.33 c rapidlearning : 0.00 0 0 0 0 0
0.29/0.33 c Pricers : Time Calls Vars
0.29/0.33 c problem variables: 0.00 0 0
0.29/0.33 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.33 c relpscost : 0.02 1 0 5 0 0 0
0.29/0.33 c pscost : 0.00 0 0 0 0 0 0
0.29/0.33 c inference : 0.00 0 0 0 0 0 0
0.29/0.33 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.33 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.33 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.33 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.33 c random : 0.00 0 0 0 0 0 0
0.29/0.33 c Primal Heuristics : Time Calls Found
0.29/0.33 c LP solutions : 0.00 - 0
0.29/0.33 c pseudo solutions : 0.00 - 0
0.29/0.33 c oneopt : 0.00 3 1
0.29/0.33 c trivial : 0.00 2 3
0.29/0.33 c simplerounding : 0.00 6 6
0.29/0.33 c zirounding : 0.00 1 1
0.29/0.33 c rounding : 0.00 6 1
0.29/0.33 c shifting : 0.00 6 2
0.29/0.33 c intshifting : 0.00 0 0
0.29/0.33 c twoopt : 0.00 0 0
0.29/0.33 c fixandinfer : 0.00 0 0
0.29/0.33 c feaspump : 0.00 0 0
0.29/0.33 c coefdiving : 0.00 0 0
0.29/0.33 c pscostdiving : 0.00 0 0
0.29/0.33 c fracdiving : 0.00 0 0
0.29/0.33 c veclendiving : 0.00 0 0
0.29/0.33 c intdiving : 0.00 0 0
0.29/0.33 c actconsdiving : 0.00 0 0
0.29/0.33 c objpscostdiving : 0.00 0 0
0.29/0.33 c rootsoldiving : 0.00 0 0
0.29/0.33 c linesearchdiving : 0.00 0 0
0.29/0.33 c guideddiving : 0.00 0 0
0.29/0.33 c octane : 0.00 0 0
0.29/0.33 c rens : 0.14 1 1
0.29/0.33 c rins : 0.00 0 0
0.29/0.33 c localbranching : 0.00 0 0
0.29/0.33 c mutation : 0.00 0 0
0.29/0.33 c crossover : 0.00 0 0
0.29/0.33 c dins : 0.00 0 0
0.29/0.33 c undercover : 0.00 0 0
0.29/0.33 c nlp : 0.00 0 0
0.29/0.33 c trysol : 0.00 0 0
0.29/0.33 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.33 c primal LP : 0.00 0 0 0.00 -
0.29/0.33 c dual LP : 0.01 7 340 48.57 34000.00
0.29/0.33 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.33 c barrier LP : 0.00 0 0 0.00 -
0.29/0.33 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.33 c strong branching : 0.02 5 415 83.00 20750.00
0.29/0.33 c (at root node) : - 5 415 83.00 -
0.29/0.33 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.33 c B&B Tree :
0.29/0.33 c number of runs : 2
0.29/0.33 c nodes : 1
0.29/0.33 c nodes (total) : 2
0.29/0.33 c nodes left : 0
0.29/0.33 c max depth : 0
0.29/0.33 c max depth (total): 0
0.29/0.33 c backtracks : 0 (0.0%)
0.29/0.33 c delayed cutoffs : 0
0.29/0.33 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.33 c avg switch length: 2.00
0.29/0.33 c switching time : 0.00
0.29/0.33 c Solution :
0.29/0.33 c Solutions found : 15 (6 improvements)
0.29/0.33 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.29/0.33 c Primal Bound : +4.00000000000000e+00 (in run 1, after 1 nodes, 0.22 seconds, depth 0, found by <rens>)
0.29/0.33 c Dual Bound : +4.00000000000000e+00
0.29/0.33 c Gap : 0.00 %
0.29/0.33 c Root Dual Bound : +4.00000000000000e+00
0.29/0.33 c Root Iterations : 340
0.29/0.34 c Time complete: 0.33.