0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3737626-1338729884.opb>
0.00/0.00 c original problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 99 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 88 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 404 impls, 19 clqs
0.00/0.01 c (round 2) 48 del vars, 88 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 404 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 48 deleted vars, 88 deleted constraints, 20 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 404 implications, 0 cliques
0.00/0.01 c presolved problem has 20 variables (20 bin, 0 int, 0 impl, 0 cont) and 31 constraints
0.00/0.01 c 20 constraints of type <knapsack>
0.00/0.01 c 10 constraints of type <setppc>
0.00/0.01 c 1 constraints of type <linear>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.5
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c t 0.0s| 1 | 0 | 29 | - | 333k| 0 | 20 | 20 | 31 | 20 | 31 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.01 o -1
0.00/0.01 c R 0.0s| 1 | 0 | 29 | - | 334k| 0 | 20 | 20 | 31 | 20 | 31 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.00/0.03 o -3
0.00/0.03 c y 0.0s| 1 | 0 | 29 | - | 360k| 0 | 20 | 20 | 31 | 20 | 31 | 0 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 33 | - | 399k| 0 | 20 | 20 | 75 | 20 | 35 | 4 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 43 | - | 431k| 0 | 20 | 20 | 75 | 20 | 39 | 8 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 51 | - | 463k| 0 | 20 | 20 | 75 | 20 | 42 | 11 | 0 | 0 |-4.958905e+00 |-3.000000e+00 | 39.50%
0.02/0.04 c 0.0s| 1 | 0 | 68 | - | 500k| 0 | 15 | 20 | 75 | 20 | 48 | 17 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.04 c 0.0s| 1 | 0 | 79 | - | 542k| 0 | 17 | 20 | 75 | 20 | 53 | 22 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.04 c 0.0s| 1 | 0 | 88 | - | 610k| 0 | 16 | 20 | 75 | 20 | 55 | 24 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.04 c 0.0s| 1 | 0 | 93 | - | 655k| 0 | 18 | 20 | 75 | 20 | 59 | 28 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.05 c 0.0s| 1 | 0 | 99 | - | 682k| 0 | 17 | 20 | 75 | 20 | 62 | 31 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.05 c 0.0s| 1 | 0 | 104 | - | 713k| 0 | 17 | 20 | 75 | 20 | 65 | 34 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.06 c 0.1s| 1 | 0 | 112 | - | 710k| 0 | 16 | 20 | 72 | 20 | 65 | 34 | 0 | 10 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.06 c 0.1s| 1 | 0 | 119 | - | 742k| 0 | 17 | 20 | 72 | 20 | 65 | 37 | 0 | 10 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.07 c 0.1s| 1 | 0 | 133 | - | 719k| 0 | 16 | 20 | 43 | 20 | 65 | 37 | 0 | 19 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/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.02/0.07 c 0.1s| 1 | 0 | 150 | - | 754k| 0 | 16 | 20 | 43 | 20 | 68 | 40 | 0 | 19 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.07 c 0.1s| 1 | 0 | 150 | - | 753k| 0 | - | 20 | 43 | 20 | 68 | 40 | 0 | 20 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.02/0.07 c (run 1, node 1) restarting after 5 global fixings of integer variables
0.02/0.07 c
0.02/0.07 c (restart) converted 35 cuts from the global cut pool into linear constraints
0.02/0.07 c
0.02/0.07 c presolving:
0.02/0.07 c (round 1) 6 del vars, 40 del conss, 10 add conss, 0 chg bounds, 29 chg sides, 49 chg coeffs, 0 upgd conss, 422 impls, 1 clqs
0.02/0.07 c (round 2) 6 del vars, 61 del conss, 17 add conss, 0 chg bounds, 39 chg sides, 70 chg coeffs, 0 upgd conss, 424 impls, 5 clqs
0.02/0.07 c (round 3) 6 del vars, 61 del conss, 17 add conss, 0 chg bounds, 39 chg sides, 70 chg coeffs, 17 upgd conss, 424 impls, 5 clqs
0.02/0.07 c (round 4) 6 del vars, 105 del conss, 57 add conss, 0 chg bounds, 84 chg sides, 179 chg coeffs, 17 upgd conss, 424 impls, 6 clqs
0.02/0.08 c (round 5) 6 del vars, 112 del conss, 57 add conss, 0 chg bounds, 84 chg sides, 182 chg coeffs, 17 upgd conss, 424 impls, 6 clqs
0.02/0.08 c (round 6) 6 del vars, 112 del conss, 57 add conss, 0 chg bounds, 84 chg sides, 184 chg coeffs, 17 upgd conss, 424 impls, 6 clqs
0.02/0.08 c (round 7) 6 del vars, 112 del conss, 57 add conss, 0 chg bounds, 84 chg sides, 186 chg coeffs, 17 upgd conss, 424 impls, 6 clqs
0.02/0.08 c (round 8) 6 del vars, 112 del conss, 57 add conss, 0 chg bounds, 85 chg sides, 197 chg coeffs, 17 upgd conss, 424 impls, 6 clqs
0.02/0.08 c presolving (9 rounds):
0.02/0.08 c 6 deleted vars, 112 deleted constraints, 57 added constraints, 0 tightened bounds, 0 added holes, 85 changed sides, 197 changed coefficients
0.02/0.08 c 424 implications, 6 cliques
0.02/0.08 c presolved problem has 14 variables (14 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.02/0.08 c 8 constraints of type <knapsack>
0.02/0.08 c 11 constraints of type <setppc>
0.02/0.08 c 1 constraints of type <linear>
0.02/0.08 c 3 constraints of type <logicor>
0.02/0.08 c transformed objective value is always integral (scale: 1)
0.02/0.08 c Presolving Time: 0.01
0.02/0.08 c
0.02/0.08 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.08 c 0.1s| 1 | 0 | 166 | - | 329k| 0 | - | 14 | 23 | 14 | 22 | 0 | 0 | 20 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.02/0.08 c 0.1s| 1 | 0 | 166 | - | 329k| 0 | - | 14 | 23 | 14 | 22 | 0 | 0 | 20 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.02/0.08 c
0.02/0.08 c SCIP Status : problem is solved [optimal solution found]
0.02/0.08 c Solving Time (sec) : 0.08
0.02/0.08 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.02/0.08 c Primal Bound : -3.00000000000000e+00 (3 solutions)
0.02/0.08 c Dual Bound : -3.00000000000000e+00
0.02/0.08 c Gap : 0.00 %
0.02/0.08 s OPTIMUM FOUND
0.02/0.08 v x20 x12 -x11 -x19 x15 -x13 -x16 -x18 -x17 -x14 -x10 x9 x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.02/0.08 c SCIP Status : problem is solved [optimal solution found]
0.02/0.08 c Total Time : 0.08
0.02/0.08 c solving : 0.08
0.02/0.08 c presolving : 0.01 (included in solving)
0.02/0.08 c reading : 0.00 (included in solving)
0.02/0.08 c Original Problem :
0.02/0.08 c Problem name : HOME/instance-3737626-1338729884.opb
0.02/0.08 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.08 c Constraints : 99 initial, 99 maximal
0.02/0.08 c Presolved Problem :
0.02/0.08 c Problem name : t_HOME/instance-3737626-1338729884.opb
0.02/0.08 c Variables : 14 (14 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.08 c Constraints : 23 initial, 23 maximal
0.02/0.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.02/0.08 c trivial : 0.00 5 0 0 0 0 0 0 0 0
0.02/0.08 c dualfix : 0.00 48 0 0 0 0 0 0 0 0
0.02/0.08 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.08 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.08 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.08 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.08 c knapsack : 0.00 0 0 0 0 0 26 57 79 193
0.02/0.08 c setppc : 0.00 1 0 0 0 0 54 0 0 0
0.02/0.08 c linear : 0.00 0 0 0 0 0 32 0 6 4
0.02/0.08 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.08 c pseudoboolean : 0.00 0 0 0 0 0 88 20 0 0
0.02/0.08 c root node : - 5 - - 5 - - - - -
0.02/0.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.02/0.08 c integral : 0 0 0 3 0 8 0 0 5 0 0 0
0.02/0.08 c knapsack : 8 11 44 0 0 3 0 0 0 54 0 0
0.02/0.08 c setppc : 11 11 44 0 0 2 0 0 0 0 0 0
0.02/0.08 c linear : 1 12 45 0 0 2 0 0 0 0 0 0
0.02/0.08 c logicor : 3 0 1 0 0 0 0 0 0 0 0 0
0.02/0.08 c countsols : 0 0 0 0 0 6 0 0 0 0 0 0
0.02/0.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.02/0.08 c integral : 0.01 0.00 0.00 0.01 0.00 0.00 0.00
0.02/0.08 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.08 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.08 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.08 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.08 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.02/0.08 c vbounds : 0 0 0 0
0.02/0.08 c rootredcost : 0 0 0 0
0.02/0.08 c pseudoobj : 7 0 0 0
0.02/0.08 c Propagator Timings : TotalTime Propagate Resprop
0.02/0.08 c vbounds : 0.00 0.00 0.00
0.02/0.08 c rootredcost : 0.00 0.00 0.00
0.02/0.08 c pseudoobj : 0.00 0.00 0.00
0.02/0.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.02/0.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.08 c applied globally : - - - 0 0.0 - - -
0.02/0.08 c applied locally : - - - 0 0.0 - - -
0.02/0.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.02/0.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.02/0.08 c redcost : 0.00 11 0 0 0 0
0.02/0.08 c impliedbounds : 0.00 11 0 0 0 0
0.02/0.08 c intobj : 0.00 0 0 0 0 0
0.02/0.08 c gomory : 0.01 11 0 0 84 0
0.02/0.08 c cgmip : 0.00 0 0 0 0 0
0.02/0.08 c closecuts : 0.00 0 0 0 0 0
0.02/0.08 c strongcg : 0.00 11 0 0 360 0
0.02/0.08 c cmir : 0.00 10 0 0 57 0
0.02/0.08 c flowcover : 0.01 10 0 0 104 0
0.02/0.08 c clique : 0.00 1 0 0 0 0
0.02/0.08 c zerohalf : 0.00 0 0 0 0 0
0.02/0.08 c mcf : 0.00 1 0 0 0 0
0.02/0.08 c oddcycle : 0.00 0 0 0 0 0
0.02/0.08 c rapidlearning : 0.02 1 0 0 0 44
0.02/0.08 c Pricers : Time Calls Vars
0.02/0.08 c problem variables: 0.00 0 0
0.02/0.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.02/0.08 c relpscost : 0.01 3 0 5 0 0 0
0.02/0.08 c pscost : 0.00 0 0 0 0 0 0
0.02/0.08 c inference : 0.00 0 0 0 0 0 0
0.02/0.08 c mostinf : 0.00 0 0 0 0 0 0
0.02/0.08 c leastinf : 0.00 0 0 0 0 0 0
0.02/0.08 c fullstrong : 0.00 0 0 0 0 0 0
0.02/0.08 c allfullstrong : 0.00 0 0 0 0 0 0
0.02/0.08 c random : 0.00 0 0 0 0 0 0
0.02/0.08 c Primal Heuristics : Time Calls Found
0.02/0.08 c LP solutions : 0.00 - 0
0.02/0.08 c pseudo solutions : 0.00 - 0
0.02/0.08 c oneopt : 0.00 1 0
0.02/0.08 c trivial : 0.00 2 1
0.02/0.08 c shiftandpropagate: 0.00 0 0
0.02/0.08 c simplerounding : 0.00 0 0
0.02/0.08 c zirounding : 0.00 0 0
0.02/0.08 c rounding : 0.00 14 1
0.02/0.08 c shifting : 0.00 14 0
0.02/0.08 c intshifting : 0.00 0 0
0.02/0.08 c twoopt : 0.00 0 0
0.02/0.08 c fixandinfer : 0.00 0 0
0.02/0.08 c feaspump : 0.00 0 0
0.02/0.08 c clique : 0.00 0 0
0.02/0.08 c coefdiving : 0.00 0 0
0.02/0.08 c pscostdiving : 0.00 0 0
0.02/0.08 c fracdiving : 0.00 0 0
0.02/0.08 c veclendiving : 0.00 0 0
0.02/0.08 c intdiving : 0.00 0 0
0.02/0.08 c actconsdiving : 0.00 0 0
0.02/0.08 c objpscostdiving : 0.00 0 0
0.02/0.08 c rootsoldiving : 0.00 0 0
0.02/0.08 c linesearchdiving : 0.00 0 0
0.02/0.08 c guideddiving : 0.00 0 0
0.02/0.08 c octane : 0.00 0 0
0.02/0.08 c rens : 0.01 0 0
0.02/0.08 c rins : 0.00 0 0
0.02/0.08 c localbranching : 0.00 0 0
0.02/0.08 c mutation : 0.00 0 0
0.02/0.08 c crossover : 0.00 0 0
0.02/0.08 c dins : 0.00 0 0
0.02/0.08 c vbounds : 0.00 0 0
0.02/0.08 c undercover : 0.00 0 0
0.02/0.08 c subnlp : 0.00 0 0
0.02/0.08 c trysol : 0.00 0 0
0.02/0.08 c LP : Time Calls Iterations Iter/call Iter/sec
0.02/0.08 c primal LP : 0.00 0 0 0.00 -
0.02/0.08 c dual LP : 0.00 15 166 11.07 -
0.02/0.08 c lex dual LP : 0.00 0 0 0.00 -
0.02/0.08 c barrier LP : 0.00 0 0 0.00 -
0.02/0.08 c diving/probing LP: 0.00 0 0 0.00 -
0.02/0.08 c strong branching : 0.01 20 485 24.25 -
0.02/0.08 c (at root node) : - 20 485 24.25 -
0.02/0.08 c conflict analysis: 0.00 0 0 0.00 -
0.02/0.08 c B&B Tree :
0.02/0.08 c number of runs : 2
0.02/0.08 c nodes : 1
0.02/0.08 c nodes (total) : 2
0.02/0.08 c nodes left : 0
0.02/0.08 c max depth : 0
0.02/0.08 c max depth (total): 0
0.02/0.08 c backtracks : 0 (0.0%)
0.02/0.08 c delayed cutoffs : 0
0.02/0.08 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.02/0.08 c avg switch length: 2.00
0.02/0.08 c switching time : 0.00
0.02/0.08 c Solution :
0.02/0.08 c Solutions found : 3 (3 improvements)
0.02/0.08 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.02/0.08 c Primal Bound : -3.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <trysol>)
0.02/0.08 c Dual Bound : -3.00000000000000e+00
0.02/0.08 c Gap : 0.00 %
0.02/0.08 c Root Dual Bound : -3.00000000000000e+00
0.02/0.08 c Root Iterations : 166
0.02/0.08 c Time complete: 0.08.