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-2704542-1278561449.opb>
0.00/0.01 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 50
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.000000e+01
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 0 cliques
0.00/0.03 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.03 c 100 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1789.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 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.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.03/0.07 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.07 c t 0.0s| 1 | 0 | 400 | - | 691k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 5.000000e+01 |3900.00%
0.03/0.07 o 49
0.03/0.07 c R 0.1s| 1 | 0 | 400 | - | 693k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.900000e+01 |3820.00%
0.03/0.07 o 48
0.03/0.07 c s 0.1s| 1 | 0 | 400 | - | 695k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.800000e+01 |3740.00%
0.03/0.08 o 4
0.03/0.08 c z 0.1s| 1 | 0 | 400 | - | 696k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.03/0.09 c 0.1s| 1 | 0 | 400 | - | 696k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.49/0.50 c 0.5s| 1 | 2 | 400 | - | 697k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 18 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.49/0.50 o 3
0.49/0.50 c * 0.5s| 49 | 1 | 400 | 0.0 | 705k| 48 | - | 50 | 100 | 0 | 0 | 0 | 0 | 18 | 1.256345e+00 | 3.000000e+00 | 138.79%
0.49/0.51 o 2
0.49/0.51 c * 0.5s| 132 | 0 | 400 | 0.0 | 710k| 48 | - | 50 | 100 | 0 | 0 | 0 | 29 | 18 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.49/0.51 c
0.49/0.51 c SCIP Status : problem is solved [optimal solution found]
0.49/0.51 c Solving Time (sec) : 0.49
0.49/0.51 c Solving Nodes : 132
0.49/0.51 c Primal Bound : +2.00000000000000e+00 (8 solutions)
0.49/0.51 c Dual Bound : +2.00000000000000e+00
0.49/0.51 c Gap : 0.00 %
0.49/0.51 s OPTIMUM FOUND
0.49/0.51 v -x50 -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.49/0.51 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.49/0.51 c SCIP Status : problem is solved [optimal solution found]
0.49/0.51 c Solving Time : 0.49
0.49/0.51 c Original Problem :
0.49/0.51 c Problem name : HOME/instance-2704542-1278561449.opb
0.49/0.51 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.51 c Constraints : 100 initial, 100 maximal
0.49/0.51 c Presolved Problem :
0.49/0.51 c Problem name : t_HOME/instance-2704542-1278561449.opb
0.49/0.51 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.51 c Constraints : 100 initial, 100 maximal
0.49/0.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.51 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c root node : - 1 - - 1 - - - -
0.49/0.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.51 c integral : 0 0 0 1 0 0 0 0 0 2
0.49/0.51 c logicor : 100+ 1 117 0 1 23 46 0 0 0
0.49/0.51 c countsols : 0 0 0 0 2 0 0 0 0 0
0.49/0.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.51 c integral : 0.41 0.00 0.00 0.41 0.00
0.49/0.51 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.51 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.51 c Propagators : Time Calls Cutoffs DomReds
0.49/0.51 c vbounds : 0.00 2 0 0
0.49/0.51 c rootredcost : 0.00 1 0 0
0.49/0.51 c pseudoobj : 0.00 199 6 103
0.49/0.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.51 c propagation : 0.00 29 29 29 43.2 0 0.0 -
0.49/0.51 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.51 c applied globally : - - - 0 0.0 - - -
0.49/0.51 c applied locally : - - - 29 43.2 - - -
0.49/0.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.51 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.51 c redcost : 0.00 2 0 0 0 0
0.49/0.51 c impliedbounds : 0.00 2 0 0 0 0
0.49/0.51 c intobj : 0.00 0 0 0 0 0
0.49/0.51 c cgmip : 0.00 0 0 0 0 0
0.49/0.51 c gomory : 0.00 2 0 0 0 0
0.49/0.51 c strongcg : 0.00 2 0 0 0 0
0.49/0.51 c cmir : 0.01 2 0 0 0 0
0.49/0.51 c flowcover : 0.01 2 0 0 0 0
0.49/0.51 c clique : 0.00 1 0 0 0 0
0.49/0.51 c zerohalf : 0.00 0 0 0 0 0
0.49/0.51 c mcf : 0.00 1 0 0 0 0
0.49/0.51 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.51 c Pricers : Time Calls Vars
0.49/0.51 c problem variables: 0.00 0 0
0.49/0.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.51 c relpscost : 0.41 1 0 0 0 0 2
0.49/0.51 c pscost : 0.00 0 0 0 0 0 0
0.49/0.51 c inference : 0.00 119 0 0 0 0 238
0.49/0.51 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.51 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.51 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.51 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.51 c random : 0.00 0 0 0 0 0 0
0.49/0.51 c Primal Heuristics : Time Calls Found
0.49/0.51 c LP solutions : 0.00 - 0
0.49/0.51 c pseudo solutions : 0.00 - 2
0.49/0.51 c crossover : 0.00 0 0
0.49/0.51 c oneopt : 0.00 1 0
0.49/0.51 c trivial : 0.00 2 3
0.49/0.51 c simplerounding : 0.00 1 0
0.49/0.51 c zirounding : 0.00 1 1
0.49/0.51 c rounding : 0.00 1 1
0.49/0.51 c shifting : 0.00 1 1
0.49/0.51 c intshifting : 0.00 0 0
0.49/0.51 c twoopt : 0.00 0 0
0.49/0.51 c fixandinfer : 0.00 0 0
0.49/0.51 c feaspump : 0.00 0 0
0.49/0.51 c coefdiving : 0.00 0 0
0.49/0.51 c pscostdiving : 0.00 0 0
0.49/0.51 c fracdiving : 0.00 0 0
0.49/0.51 c veclendiving : 0.00 0 0
0.49/0.51 c intdiving : 0.00 0 0
0.49/0.51 c actconsdiving : 0.00 0 0
0.49/0.51 c objpscostdiving : 0.00 0 0
0.49/0.51 c rootsoldiving : 0.00 0 0
0.49/0.51 c linesearchdiving : 0.00 0 0
0.49/0.51 c guideddiving : 0.00 0 0
0.49/0.51 c octane : 0.00 0 0
0.49/0.51 c rens : 0.01 0 0
0.49/0.51 c rins : 0.00 0 0
0.49/0.51 c localbranching : 0.00 0 0
0.49/0.51 c mutation : 0.00 0 0
0.49/0.51 c dins : 0.00 0 0
0.49/0.51 c undercover : 0.00 0 0
0.49/0.51 c nlp : 0.00 0 0
0.49/0.51 c trysol : 0.00 0 0
0.49/0.51 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.51 c primal LP : 0.00 0 0 0.00 -
0.49/0.51 c dual LP : 0.03 1 400 400.00 11429.22
0.49/0.51 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.51 c barrier LP : 0.00 0 0 0.00 -
0.49/0.51 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.51 c strong branching : 0.41 18 2625 145.83 6434.15
0.49/0.51 c (at root node) : - 18 2625 145.83 -
0.49/0.51 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.51 c B&B Tree :
0.49/0.51 c number of runs : 1
0.49/0.51 c nodes : 132
0.49/0.51 c nodes (total) : 132
0.49/0.51 c nodes left : 0
0.49/0.51 c max depth : 48
0.49/0.51 c max depth (total): 48
0.49/0.51 c backtracks : 22 (16.7%)
0.49/0.51 c delayed cutoffs : 19
0.49/0.51 c repropagations : 27 (112 domain reductions, 19 cutoffs)
0.49/0.51 c avg switch length: 2.00
0.49/0.51 c switching time : 0.00
0.49/0.51 c Solution :
0.49/0.51 c Solutions found : 8 (6 improvements)
0.49/0.51 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.49/0.51 c Primal Bound : +2.00000000000000e+00 (in run 1, after 132 nodes, 0.49 seconds, depth 46, found by <relaxation>)
0.49/0.51 c Dual Bound : +2.00000000000000e+00
0.49/0.51 c Gap : 0.00 %
0.49/0.51 c Root Dual Bound : +1.25000000000000e+00
0.49/0.51 c Root Iterations : 400
0.49/0.52 c Time complete: 0.51.