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-2703272-1278570211.opb>
0.00/0.01 c original problem has 358 variables (358 bin, 0 int, 0 impl, 0 cont) and 358 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 0
0.00/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.02 c presolving:
0.01/0.04 c (round 1) 308 del vars, 50 del conss, 308 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1232 impls, 0 clqs
0.01/0.04 c presolving (2 rounds):
0.01/0.04 c 308 deleted vars, 50 deleted constraints, 308 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 1848 implications, 0 cliques
0.01/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 308 constraints
0.01/0.04 c 308 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.03
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.3
0.01/0.04 c
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = 0
0.01/0.04 c
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = TRUE
0.01/0.04 c
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = 1
0.01/0.04 c
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1789.99
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = 0
0.01/0.04 c
0.01/0.04 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.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = a
0.01/0.04 c
0.01/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.04 c # [type: int, range: [1,2], default: 1]
0.01/0.04 c timing/clocktype = 2
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/indicator/addCouplingCons = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = 1000000
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.05 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.05 c t 0.0s| 1 | 0 | 52 | - |1074k| 0 | 50 | 50 | 308 | 50 | 308 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.01/0.05 o -1
0.01/0.05 c R 0.0s| 1 | 0 | 52 | - |1075k| 0 | 50 | 50 | 308 | 50 | 308 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.01/0.05 o -2
0.01/0.05 c s 0.0s| 1 | 0 | 52 | - |1075k| 0 | 50 | 50 | 308 | 50 | 308 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.01/0.06 c 0.0s| 1 | 0 | 85 | - |1080k| 0 | 43 | 50 | 308 | 50 | 315 | 7 | 0 | 0 |-2.150000e+01 |-2.000000e+00 | 90.70%
0.01/0.06 o -9
0.01/0.06 c b 0.0s| 1 | 0 | 85 | - |1082k| 0 | 43 | 50 | 308 | 50 | 315 | 7 | 0 | 0 |-2.150000e+01 |-9.000000e+00 | 58.14%
0.01/0.08 c 0.1s| 1 | 0 | 138 | - |1086k| 0 | 38 | 50 | 308 | 50 | 321 | 13 | 0 | 0 |-1.900000e+01 |-9.000000e+00 | 52.63%
0.01/0.09 c 0.1s| 1 | 0 | 184 | - |1090k| 0 | 39 | 50 | 308 | 50 | 329 | 21 | 0 | 0 |-1.750000e+01 |-9.000000e+00 | 48.57%
0.09/0.12 c 0.1s| 1 | 0 | 237 | - |1101k| 0 | 37 | 50 | 308 | 50 | 336 | 28 | 0 | 0 |-1.675000e+01 |-9.000000e+00 | 46.27%
0.09/0.15 c 0.1s| 1 | 0 | 275 | - |1112k| 0 | 32 | 50 | 308 | 50 | 345 | 37 | 0 | 0 |-1.600000e+01 |-9.000000e+00 | 43.75%
0.09/0.18 c 0.2s| 1 | 0 | 342 | - |1133k| 0 | 34 | 50 | 308 | 50 | 350 | 42 | 0 | 0 |-1.575000e+01 |-9.000000e+00 | 42.86%
0.19/0.21 c 0.2s| 1 | 0 | 390 | - |1152k| 0 | 45 | 50 | 308 | 50 | 359 | 51 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.19/0.26 c 0.2s| 1 | 0 | 460 | - |1228k| 0 | 37 | 50 | 308 | 50 | 367 | 59 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.29/0.30 c 0.3s| 1 | 0 | 505 | - |1235k| 0 | 46 | 50 | 308 | 50 | 372 | 64 | 0 | 0 |-1.487162e+01 |-9.000000e+00 | 39.48%
0.29/0.36 c 0.3s| 1 | 0 | 546 | - |1623k| 0 | 41 | 50 | 308 | 50 | 381 | 73 | 0 | 0 |-1.460000e+01 |-9.000000e+00 | 38.36%
0.39/0.41 c 0.4s| 1 | 0 | 565 | - |1759k| 0 | 46 | 50 | 308 | 50 | 132 | 80 | 0 | 0 |-1.450000e+01 |-9.000000e+00 | 37.93%
0.39/0.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.42 c 0.4s| 1 | 0 | 590 | - |1888k| 0 | 42 | 50 | 308 | 50 | 138 | 86 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.39/0.44 c 0.4s| 1 | 0 | 611 | - |2012k| 0 | 46 | 50 | 308 | 50 | 145 | 93 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.39/0.46 c 0.4s| 1 | 0 | 650 | - |2057k| 0 | 46 | 50 | 308 | 50 | 152 | 100 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.39/0.47 c 0.5s| 1 | 0 | 684 | - |2100k| 0 | 47 | 50 | 308 | 50 | 157 | 105 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.49/0.50 c 0.5s| 1 | 0 | 711 | - |2317k| 0 | 47 | 50 | 308 | 50 | 162 | 110 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.49/0.52 c 0.5s| 1 | 0 | 734 | - |2380k| 0 | 49 | 50 | 308 | 50 | 112 | 113 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.59/0.66 c 0.6s| 1 | 2 | 734 | - |2381k| 0 | 49 | 50 | 308 | 50 | 112 | 113 | 0 | 20 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.59/0.66 o -10
0.59/0.66 c * 0.6s| 35 | 5 | 734 | 0.0 |2386k| 10 | - | 50 | 308 | 0 | 0 | 113 | 0 | 20 |-1.387774e+01 |-1.000000e+01 | 27.94%
0.59/0.67 o -11
0.59/0.67 c * 0.7s| 175 | 8 | 734 | 0.0 |2388k| 15 | - | 50 | 308 | 0 | 0 | 113 | 0 | 20 |-1.387774e+01 |-1.100000e+01 | 20.74%
1.19/1.25 o -12
1.19/1.25 c * 1.2s| 7164 | 3 | 734 | 0.0 |2395k| 30 | - | 50 | 322 | 0 | 0 | 113 |2855 | 20 |-1.387774e+01 |-1.200000e+01 | 13.53%
1.49/1.52 c 1.5s| 10000 | 4 | 734 | 0.0 |2251k| 35 | - | 50 | 40 | 0 | 0 | 113 |4500 | 20 |-1.387774e+01 |-1.200000e+01 | 13.53%
1.49/1.52 c
1.49/1.52 c SCIP Status : problem is solved [optimal solution found]
1.49/1.52 c Solving Time (sec) : 1.51
1.49/1.52 c Solving Nodes : 10023
1.49/1.52 c Primal Bound : -1.20000000000000e+01 (9 solutions)
1.49/1.52 c Dual Bound : -1.20000000000000e+01
1.49/1.52 c Gap : 0.00 %
1.49/1.52 s OPTIMUM FOUND
1.49/1.52 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 -x24
1.49/1.52 v -x23 -x22 -x21 x20 -x19 x18 -x17 -x16 x15 x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.49/1.52 c SCIP Status : problem is solved [optimal solution found]
1.49/1.52 c Solving Time : 1.51
1.49/1.52 c Original Problem :
1.49/1.52 c Problem name : HOME/instance-2703272-1278570211.opb
1.49/1.52 c Variables : 358 (358 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.52 c Constraints : 358 initial, 358 maximal
1.49/1.52 c Presolved Problem :
1.49/1.52 c Problem name : t_HOME/instance-2703272-1278570211.opb
1.49/1.52 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.52 c Constraints : 308 initial, 523 maximal
1.49/1.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.52 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c probing : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c linear : 0.00 308 0 0 308 0 50 0 0
1.49/1.52 c logicor : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c root node : - 50 - - 50 - - - -
1.49/1.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.52 c integral : 0 0 0 1 0 0 0 0 0 2
1.49/1.52 c logicor : 308+ 17 14326 0 3 3211 24780 3 0 0
1.49/1.52 c countsols : 0 0 0 0 3 0 0 0 0 0
1.49/1.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.52 c integral : 0.13 0.00 0.00 0.13 0.00
1.49/1.52 c logicor : 0.21 0.00 0.21 0.00 0.00
1.49/1.52 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.52 c Propagators : Time Calls Cutoffs DomReds
1.49/1.52 c vbounds : 0.01 2 0 0
1.49/1.52 c rootredcost : 0.02 3 0 0
1.49/1.52 c pseudoobj : 0.21 33917 2468 26686
1.49/1.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.52 c propagation : 0.14 5679 4517 4517 4.0 0 0.0 -
1.49/1.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.52 c applied globally : - - - 4517 4.0 - - -
1.49/1.52 c applied locally : - - - 0 0.0 - - -
1.49/1.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.52 c cut pool : 0.00 16 - - 160 - (maximal pool size: 843)
1.49/1.52 c redcost : 0.00 17 0 0 0 0
1.49/1.52 c impliedbounds : 0.00 17 0 0 6 0
1.49/1.52 c intobj : 0.00 0 0 0 0 0
1.49/1.52 c cgmip : 0.00 0 0 0 0 0
1.49/1.52 c gomory : 0.18 17 0 0 2816 0
1.49/1.52 c strongcg : 0.15 17 0 0 2984 0
1.49/1.52 c cmir : 0.02 10 0 0 0 0
1.49/1.52 c flowcover : 0.03 10 0 0 0 0
1.49/1.52 c clique : 0.00 17 0 0 112 0
1.49/1.52 c zerohalf : 0.00 0 0 0 0 0
1.49/1.52 c mcf : 0.00 1 0 0 0 0
1.49/1.52 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.52 c Pricers : Time Calls Vars
1.49/1.52 c problem variables: 0.00 0 0
1.49/1.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.52 c relpscost : 0.13 1 0 0 0 0 2
1.49/1.52 c pscost : 0.00 0 0 0 0 0 0
1.49/1.52 c inference : 0.03 5847 0 0 0 0 11694
1.49/1.52 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.52 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.52 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.52 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.52 c random : 0.00 0 0 0 0 0 0
1.49/1.52 c Primal Heuristics : Time Calls Found
1.49/1.52 c LP solutions : 0.00 - 0
1.49/1.52 c pseudo solutions : 0.00 - 3
1.49/1.52 c crossover : 0.00 0 0
1.49/1.52 c oneopt : 0.01 2 1
1.49/1.52 c trivial : 0.00 2 2
1.49/1.52 c simplerounding : 0.00 18 0
1.49/1.52 c zirounding : 0.00 1 1
1.49/1.52 c rounding : 0.00 18 1
1.49/1.52 c shifting : 0.00 18 1
1.49/1.52 c intshifting : 0.00 0 0
1.49/1.52 c twoopt : 0.00 0 0
1.49/1.52 c fixandinfer : 0.00 0 0
1.49/1.52 c feaspump : 0.00 0 0
1.49/1.52 c coefdiving : 0.00 0 0
1.49/1.52 c pscostdiving : 0.00 0 0
1.49/1.52 c fracdiving : 0.00 0 0
1.49/1.52 c veclendiving : 0.00 0 0
1.49/1.52 c intdiving : 0.00 0 0
1.49/1.52 c actconsdiving : 0.00 0 0
1.49/1.52 c objpscostdiving : 0.00 0 0
1.49/1.52 c rootsoldiving : 0.00 0 0
1.49/1.52 c linesearchdiving : 0.00 0 0
1.49/1.52 c guideddiving : 0.00 0 0
1.49/1.52 c octane : 0.00 0 0
1.49/1.52 c rens : 0.01 0 0
1.49/1.52 c rins : 0.00 0 0
1.49/1.52 c localbranching : 0.00 0 0
1.49/1.52 c mutation : 0.00 0 0
1.49/1.52 c dins : 0.00 0 0
1.49/1.52 c undercover : 0.00 0 0
1.49/1.52 c nlp : 0.00 0 0
1.49/1.52 c trysol : 0.00 0 0
1.49/1.52 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.52 c primal LP : 0.00 0 0 0.00 -
1.49/1.52 c dual LP : 0.06 18 734 40.78 11292.48
1.49/1.52 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.52 c barrier LP : 0.00 0 0 0.00 -
1.49/1.52 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.52 c strong branching : 0.13 20 1838 91.90 14030.75
1.49/1.52 c (at root node) : - 20 1838 91.90 -
1.49/1.52 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.52 c B&B Tree :
1.49/1.52 c number of runs : 1
1.49/1.52 c nodes : 10023
1.49/1.52 c nodes (total) : 10023
1.49/1.52 c nodes left : 0
1.49/1.52 c max depth : 37
1.49/1.52 c max depth (total): 37
1.49/1.52 c backtracks : 1917 (19.1%)
1.49/1.52 c delayed cutoffs : 1668
1.49/1.52 c repropagations : 13660 (17687 domain reductions, 1507 cutoffs)
1.49/1.52 c avg switch length: 3.82
1.49/1.52 c switching time : 0.14
1.49/1.52 c Solution :
1.49/1.52 c Solutions found : 9 (7 improvements)
1.49/1.52 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.49/1.52 c Primal Bound : -1.20000000000000e+01 (in run 1, after 7164 nodes, 1.24 seconds, depth 20, found by <relaxation>)
1.49/1.52 c Dual Bound : -1.20000000000000e+01
1.49/1.52 c Gap : 0.00 %
1.49/1.52 c Root Dual Bound : -1.40000000000000e+01
1.49/1.52 c Root Iterations : 734
1.49/1.53 c Time complete: 1.52.