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-2703260-1278569487.opb>
0.00/0.02 c original problem has 788 variables (788 bin, 0 int, 0 impl, 0 cont) and 788 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.02/0.02 o 0
0.02/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.02/0.02 c presolving:
0.02/0.09 c (round 1) 738 del vars, 50 del conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2952 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 738 deleted vars, 50 deleted constraints, 738 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 4428 implications, 0 cliques
0.09/0.11 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 738 constraints
0.09/0.11 c 738 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1789.99
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = 0
0.09/0.11 c
0.09/0.11 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.09/0.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.12 c t 0.1s| 1 | 0 | 51 | - |2192k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.09/0.12 o -1
0.09/0.12 c R 0.1s| 1 | 0 | 51 | - |2193k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.09/0.12 o -2
0.09/0.12 c s 0.1s| 1 | 0 | 51 | - |2193k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.09/0.14 c 0.1s| 1 | 0 | 108 | - |2199k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-2.000000e+00 | 87.88%
0.09/0.14 o -4
0.09/0.14 c b 0.1s| 1 | 0 | 108 | - |2201k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-4.000000e+00 | 75.76%
0.09/0.18 c 0.2s| 1 | 0 | 169 | - |2205k| 0 | 25 | 50 | 738 | 50 | 749 | 11 | 0 | 0 |-1.250000e+01 |-4.000000e+00 | 68.00%
0.19/0.22 c 0.2s| 1 | 0 | 209 | - |2211k| 0 | 23 | 50 | 738 | 50 | 754 | 16 | 0 | 0 |-1.150000e+01 |-4.000000e+00 | 65.22%
0.19/0.26 c 0.2s| 1 | 0 | 254 | - |2216k| 0 | 34 | 50 | 738 | 50 | 759 | 21 | 0 | 0 |-1.056250e+01 |-4.000000e+00 | 62.13%
0.29/0.33 c 0.3s| 1 | 0 | 311 | - |2292k| 0 | 30 | 50 | 738 | 50 | 766 | 28 | 0 | 0 |-9.714286e+00 |-4.000000e+00 | 58.82%
0.39/0.40 c 0.4s| 1 | 0 | 386 | - |2340k| 0 | 23 | 50 | 738 | 50 | 773 | 35 | 0 | 0 |-8.750000e+00 |-4.000000e+00 | 54.29%
0.39/0.46 c 0.4s| 1 | 0 | 404 | - |2423k| 0 | 30 | 50 | 738 | 50 | 781 | 43 | 0 | 0 |-8.541667e+00 |-4.000000e+00 | 53.17%
0.49/0.54 c 0.5s| 1 | 0 | 443 | - |2548k| 0 | 22 | 50 | 738 | 50 | 788 | 50 | 0 | 0 |-8.333333e+00 |-4.000000e+00 | 52.00%
0.59/0.61 c 0.6s| 1 | 0 | 477 | - |2584k| 0 | 31 | 50 | 738 | 50 | 793 | 55 | 0 | 0 |-8.129577e+00 |-4.000000e+00 | 50.80%
0.69/0.71 c 0.7s| 1 | 0 | 518 | - |3006k| 0 | 30 | 50 | 738 | 50 | 799 | 61 | 0 | 0 |-7.941176e+00 |-4.000000e+00 | 49.63%
0.69/0.79 c 0.8s| 1 | 0 | 558 | - |3246k| 0 | 34 | 50 | 738 | 50 | 117 | 69 | 0 | 0 |-7.662626e+00 |-4.000000e+00 | 47.80%
0.79/0.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.81 c 0.8s| 1 | 0 | 586 | - |3536k| 0 | 36 | 50 | 738 | 50 | 124 | 76 | 0 | 0 |-7.450753e+00 |-4.000000e+00 | 46.31%
0.79/0.83 c 0.8s| 1 | 0 | 639 | - |3616k| 0 | 33 | 50 | 738 | 50 | 136 | 88 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.79/0.84 c 0.8s| 1 | 0 | 695 | - |3639k| 0 | 36 | 50 | 738 | 50 | 143 | 95 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.79/0.86 c 0.8s| 1 | 0 | 720 | - |3771k| 0 | 40 | 50 | 738 | 50 | 151 | 103 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.79/0.88 c 0.9s| 1 | 0 | 739 | - |3884k| 0 | 43 | 50 | 738 | 50 | 159 | 111 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/0.90 c 0.9s| 1 | 0 | 772 | - |4005k| 0 | 45 | 50 | 738 | 50 | 120 | 121 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/0.92 c 0.9s| 1 | 0 | 819 | - |4074k| 0 | 45 | 50 | 738 | 50 | 128 | 129 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
1.09/1.16 c 1.1s| 1 | 2 | 819 | - |4075k| 0 | 45 | 50 | 738 | 50 | 128 | 129 | 0 | 20 |-7.000000e+00 |-4.000000e+00 | 42.86%
1.09/1.16 o -5
1.09/1.16 c * 1.1s| 8 | 3 | 819 | 0.0 |4080k| 5 | - | 50 | 738 | 0 | 0 | 129 | 0 | 20 |-6.998700e+00 |-5.000000e+00 | 28.56%
1.09/1.17 o -6
1.09/1.17 c * 1.2s| 27 | 0 | 819 | 0.0 |4081k| 8 | - | 50 | 739 | 0 | 0 | 129 | 1 | 20 |-6.000000e+00 |-6.000000e+00 | 0.00%
1.09/1.17 c
1.09/1.17 c SCIP Status : problem is solved [optimal solution found]
1.09/1.17 c Solving Time (sec) : 1.15
1.09/1.17 c Solving Nodes : 27
1.09/1.17 c Primal Bound : -6.00000000000000e+00 (10 solutions)
1.09/1.17 c Dual Bound : -6.00000000000000e+00
1.09/1.17 c Gap : 0.00 %
1.09/1.17 s OPTIMUM FOUND
1.09/1.17 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.09/1.17 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.09/1.17 c SCIP Status : problem is solved [optimal solution found]
1.09/1.17 c Solving Time : 1.15
1.09/1.17 c Original Problem :
1.09/1.17 c Problem name : HOME/instance-2703260-1278569487.opb
1.09/1.17 c Variables : 788 (788 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.17 c Constraints : 788 initial, 788 maximal
1.09/1.17 c Presolved Problem :
1.09/1.17 c Problem name : t_HOME/instance-2703260-1278569487.opb
1.09/1.17 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.17 c Constraints : 738 initial, 739 maximal
1.09/1.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.09/1.17 c trivial : 0.00 0 0 0 0 0 0 0 0
1.09/1.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.09/1.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.09/1.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.09/1.17 c implics : 0.00 0 0 0 0 0 0 0 0
1.09/1.17 c probing : 0.01 0 0 0 0 0 0 0 0
1.09/1.17 c linear : 0.00 738 0 0 738 0 50 0 0
1.09/1.17 c logicor : 0.01 0 0 0 0 0 0 0 0
1.09/1.17 c root node : - 0 - - 0 - - - -
1.09/1.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.09/1.17 c integral : 0 0 0 1 0 0 0 0 0 2
1.09/1.17 c logicor : 738+ 18 127 0 2 2 105 8 0 0
1.09/1.17 c countsols : 0 0 0 0 2 0 0 0 0 0
1.09/1.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.09/1.17 c integral : 0.23 0.00 0.00 0.23 0.00
1.09/1.17 c logicor : 0.01 0.00 0.00 0.00 0.00
1.09/1.17 c countsols : 0.00 0.00 0.00 0.00 0.00
1.09/1.17 c Propagators : Time Calls Cutoffs DomReds
1.09/1.17 c vbounds : 0.00 2 0 0
1.09/1.17 c rootredcost : 0.00 1 0 0
1.09/1.17 c pseudoobj : 0.00 60 8 13
1.09/1.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.09/1.17 c propagation : 0.00 10 1 1 7.0 0 0.0 -
1.09/1.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.17 c applied globally : - - - 1 7.0 - - -
1.09/1.17 c applied locally : - - - 0 0.0 - - -
1.09/1.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.09/1.17 c cut pool : 0.01 17 - - 131 - (maximal pool size: 1240)
1.09/1.17 c redcost : 0.00 18 0 0 0 0
1.09/1.17 c impliedbounds : 0.00 18 0 0 16 0
1.09/1.17 c intobj : 0.00 0 0 0 0 0
1.09/1.17 c cgmip : 0.00 0 0 0 0 0
1.09/1.17 c gomory : 0.31 18 0 0 4817 0
1.09/1.17 c strongcg : 0.28 18 0 0 5134 0
1.09/1.17 c cmir : 0.03 10 0 0 0 0
1.09/1.17 c flowcover : 0.04 10 0 0 0 0
1.09/1.17 c clique : 0.01 18 0 0 152 0
1.09/1.17 c zerohalf : 0.00 0 0 0 0 0
1.09/1.17 c mcf : 0.00 1 0 0 0 0
1.09/1.17 c rapidlearning : 0.00 0 0 0 0 0
1.09/1.17 c Pricers : Time Calls Vars
1.09/1.17 c problem variables: 0.00 0 0
1.09/1.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.09/1.17 c relpscost : 0.23 1 0 0 0 0 2
1.09/1.17 c pscost : 0.00 0 0 0 0 0 0
1.09/1.17 c inference : 0.00 14 0 0 0 0 28
1.09/1.17 c mostinf : 0.00 0 0 0 0 0 0
1.09/1.17 c leastinf : 0.00 0 0 0 0 0 0
1.09/1.17 c fullstrong : 0.00 0 0 0 0 0 0
1.09/1.17 c allfullstrong : 0.00 0 0 0 0 0 0
1.09/1.17 c random : 0.00 0 0 0 0 0 0
1.09/1.17 c Primal Heuristics : Time Calls Found
1.09/1.17 c LP solutions : 0.00 - 0
1.09/1.17 c pseudo solutions : 0.00 - 2
1.09/1.17 c crossover : 0.00 0 0
1.09/1.17 c oneopt : 0.00 2 1
1.09/1.17 c trivial : 0.00 2 2
1.09/1.17 c simplerounding : 0.00 19 0
1.09/1.17 c zirounding : 0.00 1 1
1.09/1.17 c rounding : 0.01 19 1
1.09/1.17 c shifting : 0.00 19 3
1.09/1.17 c intshifting : 0.00 0 0
1.09/1.17 c twoopt : 0.00 0 0
1.09/1.17 c fixandinfer : 0.00 0 0
1.09/1.17 c feaspump : 0.00 0 0
1.09/1.17 c coefdiving : 0.00 0 0
1.09/1.17 c pscostdiving : 0.00 0 0
1.09/1.17 c fracdiving : 0.00 0 0
1.09/1.17 c veclendiving : 0.00 0 0
1.09/1.17 c intdiving : 0.00 0 0
1.09/1.17 c actconsdiving : 0.00 0 0
1.09/1.17 c objpscostdiving : 0.00 0 0
1.09/1.17 c rootsoldiving : 0.00 0 0
1.09/1.17 c linesearchdiving : 0.00 0 0
1.09/1.17 c guideddiving : 0.00 0 0
1.09/1.17 c octane : 0.00 0 0
1.09/1.17 c rens : 0.01 0 0
1.09/1.17 c rins : 0.00 0 0
1.09/1.17 c localbranching : 0.00 0 0
1.09/1.17 c mutation : 0.00 0 0
1.09/1.17 c dins : 0.00 0 0
1.09/1.17 c undercover : 0.00 0 0
1.09/1.17 c nlp : 0.00 0 0
1.09/1.17 c trysol : 0.00 0 0
1.09/1.17 c LP : Time Calls Iterations Iter/call Iter/sec
1.09/1.17 c primal LP : 0.00 0 0 0.00 -
1.09/1.17 c dual LP : 0.09 19 819 43.11 8621.23
1.09/1.17 c lex dual LP : 0.00 0 0 0.00 -
1.09/1.17 c barrier LP : 0.00 0 0 0.00 -
1.09/1.17 c diving/probing LP: 0.00 0 0 0.00 -
1.09/1.17 c strong branching : 0.23 20 2609 130.45 11245.84
1.09/1.17 c (at root node) : - 20 2609 130.45 -
1.09/1.17 c conflict analysis: 0.00 0 0 0.00 -
1.09/1.17 c B&B Tree :
1.09/1.17 c number of runs : 1
1.09/1.17 c nodes : 27
1.09/1.17 c nodes (total) : 27
1.09/1.17 c nodes left : 0
1.09/1.17 c max depth : 8
1.09/1.17 c max depth (total): 8
1.09/1.17 c backtracks : 3 (11.1%)
1.09/1.17 c delayed cutoffs : 0
1.09/1.17 c repropagations : 2 (4 domain reductions, 0 cutoffs)
1.09/1.17 c avg switch length: 2.07
1.09/1.17 c switching time : 0.00
1.09/1.17 c Solution :
1.09/1.17 c Solutions found : 10 (6 improvements)
1.09/1.17 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.09/1.17 c Primal Bound : -6.00000000000000e+00 (in run 1, after 27 nodes, 1.15 seconds, depth 8, found by <relaxation>)
1.09/1.17 c Dual Bound : -6.00000000000000e+00
1.09/1.17 c Gap : 0.00 %
1.09/1.17 c Root Dual Bound : -7.00000000000000e+00
1.09/1.17 c Root Iterations : 819
1.09/1.18 c Time complete: 1.18.