0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667626-1276592042.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.02 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.2
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 = 1799.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 # 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 # 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.02/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.04 c t 0.0s| 1 | 0 | 154 | - | 590k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.666667e+00 | 5.000000e+01 |2900.00%
0.02/0.04 o 49
0.02/0.04 c R 0.0s| 1 | 0 | 154 | - | 592k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.666667e+00 | 4.900000e+01 |2840.00%
0.02/0.05 o 48
0.02/0.05 c s 0.0s| 1 | 0 | 154 | - | 594k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.666667e+00 | 4.800000e+01 |2780.00%
0.02/0.05 o 7
0.02/0.05 c z 0.0s| 1 | 0 | 154 | - | 595k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.666667e+00 | 7.000000e+00 | 320.00%
0.02/0.06 c 0.0s| 1 | 0 | 154 | - | 595k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.666667e+00 | 7.000000e+00 | 320.00%
0.02/0.06 o 5
0.02/0.06 c b 0.0s| 1 | 0 | 154 | - | 597k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.666667e+00 | 5.000000e+00 | 200.00%
0.99/1.01 c 1.0s| 1 | 2 | 154 | - | 597k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 35 | 1.666667e+00 | 5.000000e+00 | 200.00%
0.99/1.01 o 4
0.99/1.01 c * 1.0s| 52 | 44 | 154 | 0.0 | 612k| 47 | - | 50 | 100 | 0 | 0 | 0 | 1 | 35 | 1.687274e+00 | 4.000000e+00 | 137.07%
0.99/1.02 o 3
0.99/1.02 c * 1.0s| 119 | 1 | 154 | 0.0 | 618k| 47 | - | 50 | 106 | 0 | 0 | 0 | 38 | 35 | 1.687274e+00 | 3.000000e+00 | 77.80%
1.10/1.19 c
1.10/1.19 c SCIP Status : problem is solved [optimal solution found]
1.10/1.19 c Solving Time (sec) : 1.11
1.10/1.19 c Solving Nodes : 1735
1.10/1.19 c Primal Bound : +3.00000000000000e+00 (9 solutions)
1.10/1.19 c Dual Bound : +3.00000000000000e+00
1.10/1.19 c Gap : 0.00 %
1.10/1.19 s OPTIMUM FOUND
1.10/1.19 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
1.10/1.19 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
1.10/1.19 c SCIP Status : problem is solved [optimal solution found]
1.10/1.19 c Solving Time : 1.11
1.10/1.19 c Original Problem :
1.10/1.19 c Problem name : HOME/instance-2667626-1276592042.opb
1.10/1.19 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.19 c Constraints : 100 initial, 100 maximal
1.10/1.19 c Presolved Problem :
1.10/1.19 c Problem name : t_HOME/instance-2667626-1276592042.opb
1.10/1.19 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.19 c Constraints : 100 initial, 115 maximal
1.10/1.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.10/1.19 c trivial : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c implics : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c probing : 0.01 0 0 0 0 0 0 0 0
1.10/1.19 c logicor : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c root node : - 50 - - 50 - - - -
1.10/1.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.10/1.19 c integral : 0 0 0 1 0 0 0 0 0 2
1.10/1.19 c logicor : 100+ 1 1968 0 1 924 537 0 0 0
1.10/1.19 c countsols : 0 0 0 0 2 0 0 0 0 0
1.10/1.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.10/1.19 c integral : 0.91 0.00 0.00 0.91 0.00
1.10/1.19 c logicor : 0.03 0.00 0.03 0.00 0.00
1.10/1.19 c countsols : 0.00 0.00 0.00 0.00 0.00
1.10/1.19 c Propagators : Time Calls Cutoffs DomReds
1.10/1.19 c vbounds : 0.00 2 0 0
1.10/1.19 c rootredcost : 0.00 3 0 0
1.10/1.19 c pseudoobj : 0.05 2797 14 17474
1.10/1.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.10/1.19 c propagation : 0.02 938 931 931 22.6 0 0.0 -
1.10/1.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.19 c applied globally : - - - 734 18.5 - - -
1.10/1.19 c applied locally : - - - 197 38.0 - - -
1.10/1.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.10/1.19 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.10/1.19 c redcost : 0.00 2 0 0 0 0
1.10/1.19 c impliedbounds : 0.00 2 0 0 0 0
1.10/1.19 c intobj : 0.00 0 0 0 0 0
1.10/1.19 c cgmip : 0.00 0 0 0 0 0
1.10/1.19 c gomory : 0.00 2 0 0 0 0
1.10/1.19 c strongcg : 0.01 2 0 0 0 0
1.10/1.19 c cmir : 0.00 2 0 0 0 0
1.10/1.19 c flowcover : 0.01 2 0 0 0 0
1.10/1.19 c clique : 0.00 1 0 0 0 0
1.10/1.19 c zerohalf : 0.00 0 0 0 0 0
1.10/1.19 c mcf : 0.00 1 0 0 0 0
1.10/1.19 c rapidlearning : 0.00 0 0 0 0 0
1.10/1.19 c Pricers : Time Calls Vars
1.10/1.19 c problem variables: 0.00 0 0
1.10/1.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.10/1.19 c relpscost : 0.91 1 0 0 0 0 2
1.10/1.19 c pscost : 0.00 0 0 0 0 0 0
1.10/1.19 c inference : 0.01 988 0 0 0 0 1976
1.10/1.19 c mostinf : 0.00 0 0 0 0 0 0
1.10/1.19 c leastinf : 0.00 0 0 0 0 0 0
1.10/1.19 c fullstrong : 0.00 0 0 0 0 0 0
1.10/1.19 c allfullstrong : 0.00 0 0 0 0 0 0
1.10/1.19 c random : 0.00 0 0 0 0 0 0
1.10/1.19 c Primal Heuristics : Time Calls Found
1.10/1.19 c LP solutions : 0.00 - 0
1.10/1.19 c pseudo solutions : 0.00 - 2
1.10/1.19 c crossover : 0.00 0 0
1.10/1.19 c oneopt : 0.00 1 1
1.10/1.19 c trivial : 0.00 2 3
1.10/1.19 c simplerounding : 0.00 1 0
1.10/1.19 c zirounding : 0.00 1 1
1.10/1.19 c rounding : 0.00 1 1
1.10/1.19 c shifting : 0.00 1 1
1.10/1.19 c intshifting : 0.00 0 0
1.10/1.19 c twoopt : 0.00 0 0
1.10/1.19 c fixandinfer : 0.00 0 0
1.10/1.19 c feaspump : 0.00 0 0
1.10/1.19 c coefdiving : 0.00 0 0
1.10/1.19 c pscostdiving : 0.00 0 0
1.10/1.19 c fracdiving : 0.00 0 0
1.10/1.19 c veclendiving : 0.00 0 0
1.10/1.19 c intdiving : 0.00 0 0
1.10/1.19 c actconsdiving : 0.00 0 0
1.10/1.19 c objpscostdiving : 0.00 0 0
1.10/1.19 c rootsoldiving : 0.00 0 0
1.10/1.19 c linesearchdiving : 0.00 0 0
1.10/1.19 c guideddiving : 0.00 0 0
1.10/1.19 c octane : 0.00 0 0
1.10/1.19 c rens : 0.01 0 0
1.10/1.19 c rins : 0.00 0 0
1.10/1.19 c localbranching : 0.00 0 0
1.10/1.19 c mutation : 0.00 0 0
1.10/1.19 c dins : 0.00 0 0
1.10/1.19 c undercover : 0.00 0 0
1.10/1.19 c nlp : 0.00 0 0
1.10/1.19 c trysol : 0.01 0 0
1.10/1.19 c LP : Time Calls Iterations Iter/call Iter/sec
1.10/1.19 c primal LP : 0.00 0 0 0.00 -
1.10/1.19 c dual LP : 0.01 1 154 154.00 15400.00
1.10/1.19 c lex dual LP : 0.00 0 0 0.00 -
1.10/1.19 c barrier LP : 0.00 0 0 0.00 -
1.10/1.19 c diving/probing LP: 0.00 0 0 0.00 -
1.10/1.19 c strong branching : 0.91 35 5060 144.57 5560.44
1.10/1.19 c (at root node) : - 35 5060 144.57 -
1.10/1.19 c conflict analysis: 0.00 0 0 0.00 -
1.10/1.19 c B&B Tree :
1.10/1.19 c number of runs : 1
1.10/1.19 c nodes : 1735
1.10/1.19 c nodes (total) : 1735
1.10/1.19 c nodes left : 0
1.10/1.19 c max depth : 47
1.10/1.19 c max depth (total): 47
1.10/1.19 c backtracks : 886 (51.1%)
1.10/1.19 c delayed cutoffs : 202
1.10/1.19 c repropagations : 562 (2163 domain reductions, 194 cutoffs)
1.10/1.19 c avg switch length: 2.16
1.10/1.19 c switching time : 0.02
1.10/1.19 c Solution :
1.10/1.19 c Solutions found : 9 (7 improvements)
1.10/1.19 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.10/1.19 c Primal Bound : +3.00000000000000e+00 (in run 1, after 119 nodes, 0.97 seconds, depth 43, found by <relaxation>)
1.10/1.19 c Dual Bound : +3.00000000000000e+00
1.10/1.19 c Gap : 0.00 %
1.10/1.19 c Root Dual Bound : +1.66666666666667e+00
1.10/1.19 c Root Iterations : 154
1.10/1.19 c Time complete: 1.18.