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-2667642-1276593552.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.01/0.02 o 50
0.01/0.02 c feasible solution found by trivial heuristic, objective value 5.000000e+01
0.01/0.02 c presolving:
0.01/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.01/0.03 c presolving (2 rounds):
0.01/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 0 implications, 0 cliques
0.01/0.03 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.01/0.03 c 100 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.00
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c conflict/interconss = 0
0.01/0.03 c
0.01/0.03 c # should binary conflicts be preferred?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c conflict/preferbinary = TRUE
0.01/0.03 c
0.01/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c constraints/agelimit = 1
0.01/0.03 c
0.01/0.03 c # should enforcement of pseudo solution be disabled?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/disableenfops = TRUE
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1800
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c lp/solvefreq = 0
0.01/0.03 c
0.01/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.01/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.03 c lp/pricing = a
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # priority of node selection rule <dfs> in standard mode
0.01/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.03 c nodeselection/dfs/stdpriority = 1000000
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/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.01/0.04 c t 0.0s| 1 | 0 | 177 | - | 493k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 2.500000e+00 | 5.000000e+01 |1900.00%
0.01/0.04 o 49
0.01/0.04 c R 0.0s| 1 | 0 | 177 | - | 495k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 2.500000e+00 | 4.900000e+01 |1860.00%
0.01/0.04 o 48
0.01/0.04 c s 0.0s| 1 | 0 | 177 | - | 496k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 2.500000e+00 | 4.800000e+01 |1820.00%
0.01/0.06 c 0.0s| 1 | 0 | 222 | - | 524k| 0 | 47 | 50 | 100 | 50 | 101 | 1 | 0 | 0 | 2.533844e+00 | 4.800000e+01 |1794.36%
0.01/0.06 o 7
0.01/0.06 c b 0.0s| 1 | 0 | 222 | - | 526k| 0 | 47 | 50 | 100 | 50 | 101 | 1 | 0 | 0 | 2.533844e+00 | 7.000000e+00 | 176.26%
0.01/0.08 c 0.1s| 1 | 0 | 280 | - | 616k| 0 | 35 | 50 | 100 | 50 | 102 | 2 | 0 | 0 | 2.659773e+00 | 7.000000e+00 | 163.18%
0.01/0.08 o 7
0.01/0.08 c s 0.1s| 1 | 0 | 280 | - | 618k| 0 | 35 | 50 | 100 | 50 | 102 | 2 | 0 | 0 | 2.659773e+00 | 7.000000e+00 | 163.18%
0.01/0.08 o 5
0.01/0.08 c b 0.1s| 1 | 0 | 280 | - | 620k| 0 | 35 | 50 | 100 | 50 | 102 | 2 | 0 | 0 | 2.659773e+00 | 5.000000e+00 | 87.99%
0.09/0.10 c 0.1s| 1 | 0 | 352 | - | 752k| 0 | 38 | 50 | 100 | 50 | 103 | 3 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.12 c 0.1s| 1 | 0 | 377 | - | 898k| 0 | 41 | 50 | 100 | 50 | 104 | 4 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.14 c 0.1s| 1 | 0 | 417 | - | 992k| 0 | 42 | 50 | 100 | 50 | 105 | 5 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.17 c 0.1s| 1 | 0 | 462 | - |1012k| 0 | 42 | 50 | 100 | 50 | 106 | 6 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.18 c 0.2s| 1 | 0 | 488 | - |1017k| 0 | 40 | 50 | 100 | 50 | 107 | 7 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.19/0.20 c 0.2s| 1 | 0 | 517 | - |1020k| 0 | 42 | 50 | 100 | 50 | 108 | 8 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.79/0.83 c 0.8s| 1 | 2 | 517 | - |1023k| 0 | 42 | 50 | 100 | 50 | 108 | 8 | 0 | 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
1.79/1.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.81 c 1.6s| 10000 | 20 | 517 | 0.0 |1075k| 45 | - | 50 | 112 | 0 | 0 | 8 |5670 | 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
2.79/2.86 c 2.5s| 20000 | 33 | 517 | 0.0 |1085k| 45 | - | 50 | 115 | 0 | 0 | 8 | 11k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
3.79/3.90 c 3.4s| 30000 | 30 | 517 | 0.0 |1084k| 45 | - | 50 | 110 | 0 | 0 | 8 | 17k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
4.89/4.90 c 4.2s| 40000 | 34 | 517 | 0.0 |1084k| 45 | - | 50 | 107 | 0 | 0 | 8 | 23k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
5.89/5.90 c 5.1s| 50000 | 26 | 517 | 0.0 |1084k| 45 | - | 50 | 112 | 0 | 0 | 8 | 29k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
6.89/6.93 c 6.0s| 60000 | 27 | 517 | 0.0 |1085k| 45 | - | 50 | 114 | 0 | 0 | 8 | 35k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
7.88/7.95 c 6.8s| 70000 | 29 | 517 | 0.0 |1088k| 45 | - | 50 | 116 | 0 | 0 | 8 | 41k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
8.89/8.97 c 7.7s| 80000 | 38 | 517 | 0.0 |1090k| 45 | - | 50 | 113 | 0 | 0 | 8 | 47k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
9.89/9.97 c 8.5s| 90000 | 28 | 517 | 0.0 |1089k| 45 | - | 50 | 118 | 0 | 0 | 8 | 52k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
10.89/10.98 c 9.4s|100000 | 25 | 517 | 0.0 |1088k| 45 | - | 50 | 114 | 0 | 0 | 8 | 58k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
11.89/11.98 c 10.2s|110000 | 22 | 517 | 0.0 |1088k| 45 | - | 50 | 117 | 0 | 0 | 8 | 64k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
12.69/12.79 c
12.69/12.79 c SCIP Status : problem is solved [optimal solution found]
12.69/12.79 c Solving Time (sec) : 10.94
12.69/12.79 c Solving Nodes : 118129
12.69/12.79 c Primal Bound : +5.00000000000000e+00 (17 solutions)
12.69/12.79 c Dual Bound : +5.00000000000000e+00
12.69/12.79 c Gap : 0.00 %
12.69/12.79 s OPTIMUM FOUND
12.69/12.79 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
12.69/12.79 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
12.69/12.79 c SCIP Status : problem is solved [optimal solution found]
12.69/12.79 c Solving Time : 10.94
12.69/12.79 c Original Problem :
12.69/12.79 c Problem name : HOME/instance-2667642-1276593552.opb
12.69/12.79 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
12.69/12.79 c Constraints : 100 initial, 100 maximal
12.69/12.79 c Presolved Problem :
12.69/12.79 c Problem name : t_HOME/instance-2667642-1276593552.opb
12.69/12.79 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
12.69/12.79 c Constraints : 100 initial, 131 maximal
12.69/12.79 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
12.69/12.79 c trivial : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c dualfix : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c boundshift : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c inttobinary : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c implics : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c probing : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c logicor : 0.00 0 0 0 0 0 0 0 0
12.69/12.79 c root node : - 50 - - 50 - - - -
12.69/12.79 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
12.69/12.79 c integral : 0 0 0 1 0 0 0 0 0 2
12.69/12.79 c logicor : 100+ 8 169122 0 0 67436 68243 0 0 0
12.69/12.79 c countsols : 0 0 0 0 0 0 0 0 0 0
12.69/12.79 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
12.69/12.79 c integral : 0.62 0.00 0.00 0.62 0.00
12.69/12.79 c logicor : 2.25 0.00 2.25 0.00 0.00
12.69/12.79 c countsols : 0.00 0.00 0.00 0.00 0.00
12.69/12.79 c Propagators : Time Calls Cutoffs DomReds
12.69/12.79 c vbounds : 0.09 2 0 0
12.69/12.79 c rootredcost : 0.08 0 0 0
12.69/12.79 c pseudoobj : 2.38 247238 1891 1198835
12.69/12.80 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
12.69/12.80 c propagation : 1.27 69327 69226 69226 20.9 32 30.3 -
12.69/12.80 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
12.69/12.80 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
12.69/12.80 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
12.69/12.80 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
12.69/12.80 c applied globally : - - - 60715 19.2 - - -
12.69/12.80 c applied locally : - - - 8528 33.4 - - -
12.69/12.80 c Separators : Time Calls Cutoffs DomReds Cuts Conss
12.69/12.80 c cut pool : 0.00 7 - - 0 - (maximal pool size: 291)
12.69/12.80 c redcost : 0.00 8 0 0 0 0
12.69/12.80 c impliedbounds : 0.00 8 0 0 0 0
12.69/12.80 c intobj : 0.00 0 0 0 0 0
12.69/12.80 c cgmip : 0.00 0 0 0 0 0
12.69/12.80 c gomory : 0.02 8 0 0 4 0
12.69/12.80 c strongcg : 0.03 8 0 0 287 0
12.69/12.80 c cmir : 0.02 8 0 0 1 0
12.69/12.80 c flowcover : 0.02 8 0 0 0 0
12.69/12.80 c clique : 0.00 1 0 0 0 0
12.69/12.80 c zerohalf : 0.00 0 0 0 0 0
12.69/12.80 c mcf : 0.00 1 0 0 0 0
12.69/12.80 c rapidlearning : 0.00 0 0 0 0 0
12.69/12.80 c Pricers : Time Calls Vars
12.69/12.80 c problem variables: 0.00 0 0
12.69/12.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
12.69/12.80 c relpscost : 0.62 1 0 0 0 0 2
12.69/12.80 c pscost : 0.00 0 0 0 0 0 0
12.69/12.80 c inference : 0.48 75460 0 0 0 0 150920
12.69/12.80 c mostinf : 0.00 0 0 0 0 0 0
12.69/12.80 c leastinf : 0.00 0 0 0 0 0 0
12.69/12.80 c fullstrong : 0.00 0 0 0 0 0 0
12.69/12.80 c allfullstrong : 0.00 0 0 0 0 0 0
12.69/12.80 c random : 0.00 0 0 0 0 0 0
12.69/12.80 c Primal Heuristics : Time Calls Found
12.69/12.80 c LP solutions : 0.00 - 0
12.69/12.80 c pseudo solutions : 0.00 - 0
12.69/12.80 c crossover : 0.00 0 0
12.69/12.80 c oneopt : 0.08 3 2
12.69/12.80 c trivial : 0.00 2 3
12.69/12.80 c simplerounding : 0.00 9 8
12.69/12.80 c zirounding : 0.00 1 1
12.69/12.80 c rounding : 0.00 9 1
12.69/12.80 c shifting : 0.00 9 2
12.69/12.80 c intshifting : 0.00 0 0
12.69/12.80 c twoopt : 0.00 0 0
12.69/12.80 c fixandinfer : 0.00 0 0
12.69/12.80 c feaspump : 0.00 0 0
12.69/12.80 c coefdiving : 0.00 0 0
12.69/12.80 c pscostdiving : 0.00 0 0
12.69/12.80 c fracdiving : 0.00 0 0
12.69/12.80 c veclendiving : 0.00 0 0
12.69/12.80 c intdiving : 0.00 0 0
12.69/12.80 c actconsdiving : 0.00 0 0
12.69/12.80 c objpscostdiving : 0.00 0 0
12.69/12.80 c rootsoldiving : 0.00 0 0
12.69/12.80 c linesearchdiving : 0.00 0 0
12.69/12.80 c guideddiving : 0.00 0 0
12.69/12.80 c octane : 0.00 0 0
12.69/12.80 c rens : 0.00 0 0
12.69/12.80 c rins : 0.00 0 0
12.69/12.80 c localbranching : 0.00 0 0
12.69/12.80 c mutation : 0.00 0 0
12.69/12.80 c dins : 0.00 0 0
12.69/12.80 c undercover : 0.00 0 0
12.69/12.80 c nlp : 0.05 0 0
12.69/12.80 c trysol : 0.09 0 0
12.69/12.80 c LP : Time Calls Iterations Iter/call Iter/sec
12.69/12.80 c primal LP : 0.00 0 0 0.00 -
12.69/12.80 c dual LP : 0.08 9 517 57.44 6462.50
12.69/12.80 c lex dual LP : 0.00 0 0 0.00 -
12.69/12.80 c barrier LP : 0.00 0 0 0.00 -
12.69/12.80 c diving/probing LP: 0.00 0 0 0.00 -
12.69/12.80 c strong branching : 0.62 33 4290 130.00 6919.35
12.69/12.80 c (at root node) : - 33 4290 130.00 -
12.69/12.80 c conflict analysis: 0.00 0 0 0.00 -
12.69/12.80 c B&B Tree :
12.69/12.80 c number of runs : 1
12.69/12.80 c nodes : 118129
12.69/12.80 c nodes (total) : 118129
12.69/12.80 c nodes left : 0
12.69/12.80 c max depth : 45
12.69/12.80 c max depth (total): 45
12.69/12.80 c backtracks : 61826 (52.3%)
12.69/12.80 c delayed cutoffs : 32794
12.69/12.80 c repropagations : 71149 (449332 domain reductions, 26659 cutoffs)
12.69/12.80 c avg switch length: 2.41
12.69/12.80 c switching time : 1.27
12.69/12.80 c Solution :
12.69/12.80 c Solutions found : 17 (6 improvements)
12.69/12.80 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
12.69/12.80 c Primal Bound : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <oneopt>)
12.69/12.80 c Dual Bound : +5.00000000000000e+00
12.69/12.80 c Gap : 0.00 %
12.69/12.80 c Root Dual Bound : +3.00000000000000e+00
12.69/12.80 c Root Iterations : 517
12.79/12.80 c Time complete: 12.79.