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-2667625-1276592035.opb>
0.00/0.01 c original problem has 96 variables (96 bin, 0 int, 0 impl, 0 cont) and 28 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 96
0.00/0.01 c feasible solution found by trivial heuristic, objective value 9.600000e+01
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 2) 0 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 23 upgd conss, 2 impls, 0 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 0 changed coefficients
0.00/0.02 c 2 implications, 0 cliques
0.00/0.02 c presolved problem has 96 variables (96 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.00/0.02 c 23 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.2
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 23 | - | 457k| 0 | 12 | 96 | 23 | 96 | 23 | 0 | 0 | 0 | 2.666667e+00 | 9.600000e+01 |3500.00%
0.00/0.02 o 12
0.00/0.02 c r 0.0s| 1 | 0 | 23 | - | 460k| 0 | 12 | 96 | 23 | 96 | 23 | 0 | 0 | 0 | 2.666667e+00 | 1.200000e+01 | 350.00%
0.00/0.02 o 11
0.00/0.02 c R 0.0s| 1 | 0 | 23 | - | 462k| 0 | 12 | 96 | 23 | 96 | 23 | 0 | 0 | 0 | 2.666667e+00 | 1.100000e+01 | 312.50%
0.00/0.03 c 0.0s| 1 | 0 | 27 | - | 511k| 0 | 8 | 96 | 23 | 96 | 24 | 1 | 0 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.00/0.03 o 4
0.00/0.03 c b 0.0s| 1 | 0 | 27 | - | 514k| 0 | 8 | 96 | 23 | 96 | 24 | 1 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.00/0.03 o 4
0.00/0.03 c s 0.0s| 1 | 0 | 27 | - | 515k| 0 | 8 | 96 | 23 | 96 | 24 | 1 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.00/0.03 c 0.0s| 1 | 0 | 28 | - | 549k| 0 | 13 | 96 | 23 | 96 | 25 | 2 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.00/0.04 c 0.0s| 1 | 0 | 35 | - | 605k| 0 | 11 | 96 | 23 | 96 | 26 | 3 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.00/0.05 c 0.0s| 1 | 0 | 36 | - | 666k| 0 | 6 | 96 | 23 | 96 | 27 | 4 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.00/0.05 c 0.0s| 1 | 0 | 44 | - | 699k| 0 | 12 | 96 | 23 | 96 | 28 | 5 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.00/0.06 c 0.0s| 1 | 0 | 49 | - | 740k| 0 | 9 | 96 | 23 | 96 | 29 | 6 | 0 | 0 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.07/0.09 c 0.1s| 1 | 0 | 49 | - | 745k| 0 | - | 96 | 23 | 96 | 29 | 6 | 0 | 5 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.07/0.09 c (run 1, node 1) restarting after 27 global fixings of integer variables
0.07/0.09 c
0.07/0.09 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.07/0.09 c
0.07/0.09 c presolving:
0.07/0.09 c (round 1) 27 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 2 impls, 0 clqs
0.07/0.10 c presolving (2 rounds):
0.07/0.10 c 27 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.07/0.10 c 2 implications, 0 cliques
0.07/0.10 c presolved problem has 69 variables (69 bin, 0 int, 0 impl, 0 cont) and 29 constraints
0.07/0.10 c 6 constraints of type <knapsack>
0.07/0.10 c 23 constraints of type <logicor>
0.07/0.10 c transformed objective value is always integral (scale: 1)
0.07/0.10 c Presolving Time: 0.01
0.07/0.10 c
0.10/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.10 c 0.1s| 1 | 0 | 72 | - | 563k| 0 | 8 | 69 | 29 | 69 | 29 | 0 | 0 | 5 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.10/0.11 c 0.1s| 1 | 0 | 91 | - | 599k| 0 | 13 | 69 | 29 | 69 | 30 | 1 | 0 | 5 | 3.000000e+00 | 4.000000e+00 | 33.33%
0.10/0.11 c 0.1s| 1 | 0 | 91 | - | 600k| 0 | 13 | 69 | 29 | 69 | 30 | 1 | 0 | 7 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.10/0.11 c
0.10/0.11 c SCIP Status : problem is solved [optimal solution found]
0.10/0.11 c Solving Time (sec) : 0.08
0.10/0.11 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.10/0.11 c Primal Bound : +4.00000000000000e+00 (19 solutions)
0.10/0.11 c Dual Bound : +4.00000000000000e+00
0.10/0.11 c Gap : 0.00 %
0.10/0.11 s OPTIMUM FOUND
0.10/0.11 v -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71
0.10/0.11 v -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46
0.10/0.11 v -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21
0.10/0.11 v -x20 -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.10/0.11 c SCIP Status : problem is solved [optimal solution found]
0.10/0.11 c Solving Time : 0.08
0.10/0.11 c Original Problem :
0.10/0.11 c Problem name : HOME/instance-2667625-1276592035.opb
0.10/0.11 c Variables : 96 (96 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.11 c Constraints : 28 initial, 28 maximal
0.10/0.11 c Presolved Problem :
0.10/0.11 c Problem name : t_HOME/instance-2667625-1276592035.opb
0.10/0.11 c Variables : 69 (69 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.11 c Constraints : 29 initial, 29 maximal
0.10/0.11 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.10/0.11 c trivial : 0.00 27 0 0 0 0 0 0 0
0.10/0.11 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c implics : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c probing : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c linear : 0.01 0 0 0 0 0 5 5 0
0.10/0.11 c logicor : 0.00 0 0 0 0 0 0 0 0
0.10/0.11 c root node : - 45 - - 45 - - - -
0.10/0.11 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.10/0.11 c integral : 0 0 0 2 0 1 5 0 0 0
0.10/0.11 c knapsack : 6 1 2 0 0 0 0 0 0 0
0.10/0.11 c logicor : 23 7 47 0 0 0 0 0 0 0
0.10/0.11 c countsols : 0 0 0 0 0 0 0 0 0 0
0.10/0.11 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.10/0.11 c integral : 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c logicor : 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c countsols : 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c Propagators : Time Calls Cutoffs DomReds
0.10/0.11 c vbounds : 0.00 3 0 0
0.10/0.11 c rootredcost : 0.00 0 0 0
0.10/0.11 c pseudoobj : 0.00 7 0 0
0.10/0.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.10/0.11 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.11 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.11 c applied globally : - - - 0 0.0 - - -
0.10/0.11 c applied locally : - - - 0 0.0 - - -
0.10/0.11 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.10/0.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 15)
0.10/0.11 c redcost : 0.00 7 0 40 0 0
0.10/0.11 c impliedbounds : 0.00 7 0 0 0 0
0.10/0.11 c intobj : 0.00 0 0 0 0 0
0.10/0.11 c cgmip : 0.00 0 0 0 0 0
0.10/0.11 c gomory : 0.01 7 0 0 99 0
0.10/0.11 c strongcg : 0.00 7 0 0 92 0
0.10/0.11 c cmir : 0.00 7 0 0 0 0
0.10/0.11 c flowcover : 0.00 7 0 0 0 0
0.10/0.11 c clique : 0.01 2 0 0 0 0
0.10/0.11 c zerohalf : 0.00 0 0 0 0 0
0.10/0.11 c mcf : 0.00 2 0 0 0 0
0.10/0.11 c rapidlearning : 0.00 0 0 0 0 0
0.10/0.11 c Pricers : Time Calls Vars
0.10/0.11 c problem variables: 0.00 0 0
0.10/0.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.10/0.11 c relpscost : 0.00 2 1 5 0 0 0
0.10/0.11 c pscost : 0.00 0 0 0 0 0 0
0.10/0.11 c inference : 0.00 0 0 0 0 0 0
0.10/0.11 c mostinf : 0.00 0 0 0 0 0 0
0.10/0.11 c leastinf : 0.00 0 0 0 0 0 0
0.10/0.11 c fullstrong : 0.00 0 0 0 0 0 0
0.10/0.11 c allfullstrong : 0.00 0 0 0 0 0 0
0.10/0.11 c random : 0.00 0 0 0 0 0 0
0.10/0.11 c Primal Heuristics : Time Calls Found
0.10/0.11 c LP solutions : 0.00 - 0
0.10/0.11 c pseudo solutions : 0.00 - 0
0.10/0.11 c oneopt : 0.00 2 1
0.10/0.11 c trivial : 0.00 2 3
0.10/0.11 c simplerounding : 0.00 9 9
0.10/0.11 c zirounding : 0.00 1 1
0.10/0.11 c rounding : 0.00 9 1
0.10/0.11 c shifting : 0.00 9 3
0.10/0.11 c intshifting : 0.00 0 0
0.10/0.11 c twoopt : 0.00 0 0
0.10/0.11 c fixandinfer : 0.00 0 0
0.10/0.11 c feaspump : 0.00 0 0
0.10/0.11 c coefdiving : 0.00 0 0
0.10/0.11 c pscostdiving : 0.00 0 0
0.10/0.11 c fracdiving : 0.00 0 0
0.10/0.11 c veclendiving : 0.00 0 0
0.10/0.11 c intdiving : 0.00 0 0
0.10/0.11 c actconsdiving : 0.00 0 0
0.10/0.11 c objpscostdiving : 0.00 0 0
0.10/0.11 c rootsoldiving : 0.00 0 0
0.10/0.11 c linesearchdiving : 0.00 0 0
0.10/0.11 c guideddiving : 0.00 0 0
0.10/0.11 c octane : 0.00 0 0
0.10/0.11 c rens : 0.02 1 1
0.10/0.11 c rins : 0.00 0 0
0.10/0.11 c localbranching : 0.00 0 0
0.10/0.11 c mutation : 0.00 0 0
0.10/0.11 c crossover : 0.00 0 0
0.10/0.11 c dins : 0.00 0 0
0.10/0.11 c undercover : 0.00 0 0
0.10/0.11 c nlp : 0.00 0 0
0.10/0.11 c trysol : 0.00 0 0
0.10/0.11 c LP : Time Calls Iterations Iter/call Iter/sec
0.10/0.11 c primal LP : 0.00 0 0 0.00 -
0.10/0.11 c dual LP : 0.02 9 91 10.11 4550.00
0.10/0.11 c lex dual LP : 0.00 0 0 0.00 -
0.10/0.11 c barrier LP : 0.00 0 0 0.00 -
0.10/0.11 c diving/probing LP: 0.00 0 0 0.00 -
0.10/0.11 c strong branching : 0.00 7 87 12.43 -
0.10/0.11 c (at root node) : - 7 87 12.43 -
0.10/0.11 c conflict analysis: 0.00 0 0 0.00 -
0.10/0.11 c B&B Tree :
0.10/0.11 c number of runs : 2
0.10/0.11 c nodes : 1
0.10/0.11 c nodes (total) : 2
0.10/0.11 c nodes left : 0
0.10/0.11 c max depth : 0
0.10/0.11 c max depth (total): 0
0.10/0.11 c backtracks : 0 (0.0%)
0.10/0.11 c delayed cutoffs : 0
0.10/0.11 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.10/0.11 c avg switch length: 2.00
0.10/0.11 c switching time : 0.00
0.10/0.11 c Solution :
0.10/0.11 c Solutions found : 19 (5 improvements)
0.10/0.11 c First Solution : +9.60000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.10/0.11 c Primal Bound : +4.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <shifting>)
0.10/0.11 c Dual Bound : +4.00000000000000e+00
0.10/0.11 c Gap : 0.00 %
0.10/0.11 c Root Dual Bound : +4.00000000000000e+00
0.10/0.11 c Root Iterations : 91
0.10/0.12 c Time complete: 0.11.