0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666224-1276596994.opb>
0.00/0.01 c original problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 36 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 34
0.00/0.01 c feasible solution found by trivial heuristic, objective value 3.400000e+01
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 10 del conss, 0 chg bounds, 10 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.02 c (round 2) 0 del vars, 10 del conss, 0 chg bounds, 10 chg sides, 0 chg coeffs, 26 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 10 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 26 constraints
0.00/0.02 c 26 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.00
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 | 15 | - | 247k| 0 | 7 | 34 | 26 | 34 | 26 | 0 | 0 | 0 | 3.500000e+00 | 3.400000e+01 | 871.43%
0.00/0.02 o 7
0.00/0.02 c r 0.0s| 1 | 0 | 15 | - | 248k| 0 | 7 | 34 | 26 | 34 | 26 | 0 | 0 | 0 | 3.500000e+00 | 7.000000e+00 | 100.00%
0.00/0.02 o 6
0.00/0.02 c R 0.0s| 1 | 0 | 15 | - | 249k| 0 | 7 | 34 | 26 | 34 | 26 | 0 | 0 | 0 | 3.500000e+00 | 6.000000e+00 | 71.43%
0.00/0.02 c 0.0s| 1 | 0 | 17 | - | 255k| 0 | 10 | 34 | 26 | 34 | 27 | 1 | 0 | 0 | 3.500000e+00 | 6.000000e+00 | 71.43%
0.00/0.02 o 5
0.00/0.02 c b 0.0s| 1 | 0 | 17 | - | 256k| 0 | 10 | 34 | 26 | 34 | 27 | 1 | 0 | 0 | 3.500000e+00 | 5.000000e+00 | 42.86%
0.00/0.03 c 0.0s| 1 | 0 | 21 | - | 271k| 0 | 12 | 34 | 26 | 34 | 28 | 2 | 0 | 0 | 3.500000e+00 | 5.000000e+00 | 42.86%
0.00/0.03 c 0.0s| 1 | 0 | 23 | - | 299k| 0 | 6 | 34 | 26 | 34 | 29 | 3 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.03 c 0.0s| 1 | 0 | 25 | - | 305k| 0 | 6 | 34 | 26 | 34 | 30 | 4 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.03 c 0.0s| 1 | 0 | 26 | - | 320k| 0 | 4 | 34 | 26 | 34 | 31 | 5 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.04 c 0.0s| 1 | 0 | 28 | - | 330k| 0 | 10 | 34 | 26 | 34 | 32 | 6 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.04 c 0.0s| 1 | 0 | 34 | - | 355k| 0 | 6 | 34 | 26 | 34 | 33 | 7 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.05 c 0.0s| 1 | 0 | 36 | - | 377k| 0 | 10 | 34 | 26 | 34 | 34 | 8 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.05 c 0.0s| 1 | 0 | 37 | - | 413k| 0 | 0 | 34 | 26 | 34 | 35 | 9 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.05 c (run 1, node 1) restarting after 5 global fixings of integer variables
0.02/0.05 c
0.02/0.05 c (restart) converted 9 cuts from the global cut pool into linear constraints
0.02/0.05 c
0.02/0.05 c presolving:
0.02/0.06 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 0 impls, 0 clqs
0.02/0.06 c presolving (2 rounds):
0.02/0.06 c 5 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.06 c 0 implications, 0 cliques
0.02/0.06 c presolved problem has 29 variables (29 bin, 0 int, 0 impl, 0 cont) and 35 constraints
0.02/0.06 c 9 constraints of type <knapsack>
0.02/0.06 c 26 constraints of type <logicor>
0.02/0.06 c transformed objective value is always integral (scale: 1)
0.02/0.06 c Presolving Time: 0.01
0.02/0.06 c
0.02/0.06 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.06 c 0.0s| 1 | 0 | 61 | - | 308k| 0 | 4 | 29 | 35 | 29 | 35 | 0 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.07 c 0.0s| 1 | 0 | 65 | - | 320k| 0 | 10 | 29 | 35 | 29 | 36 | 1 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.02/0.07 o 4
0.02/0.07 c z 0.1s| 1 | 0 | 65 | - | 322k| 0 | - | 29 | 35 | 29 | 36 | 1 | 0 | 10 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.02/0.07 c
0.02/0.07 c SCIP Status : problem is solved [optimal solution found]
0.02/0.07 c Solving Time (sec) : 0.05
0.02/0.07 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.02/0.07 c Primal Bound : +4.00000000000000e+00 (24 solutions)
0.02/0.07 c Dual Bound : +4.00000000000000e+00
0.02/0.07 c Gap : 0.00 %
0.02/0.07 s OPTIMUM FOUND
0.02/0.07 v -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 -x25 -x24 x23 -x22 -x21 -x20 -x19 x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8
0.02/0.07 v -x7 -x6 -x5 -x4 -x3 x2 -x1
0.02/0.07 c SCIP Status : problem is solved [optimal solution found]
0.02/0.07 c Solving Time : 0.05
0.02/0.07 c Original Problem :
0.02/0.07 c Problem name : HOME/instance-2666224-1276596994.opb
0.02/0.07 c Variables : 34 (34 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.07 c Constraints : 36 initial, 36 maximal
0.02/0.07 c Presolved Problem :
0.02/0.07 c Problem name : t_HOME/instance-2666224-1276596994.opb
0.02/0.07 c Variables : 29 (29 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.07 c Constraints : 35 initial, 35 maximal
0.02/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.02/0.07 c trivial : 0.00 5 0 0 0 0 0 0 0
0.02/0.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.02/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.02/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.02/0.07 c implics : 0.00 0 0 0 0 0 0 0 0
0.02/0.07 c probing : 0.00 0 0 0 0 0 0 0 0
0.02/0.07 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.02/0.07 c linear : 0.00 0 0 0 0 0 10 10 0
0.02/0.07 c logicor : 0.01 0 0 0 0 0 0 0 0
0.02/0.07 c root node : - 5 - - 5 - - - -
0.02/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.02/0.07 c integral : 0 0 0 2 0 0 0 0 0 2
0.02/0.07 c knapsack : 9 1 1 0 0 0 0 0 0 0
0.02/0.07 c logicor : 26 11 25 1 0 0 0 0 0 0
0.02/0.07 c countsols : 0 0 0 1 0 0 0 0 0 0
0.02/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.02/0.07 c integral : 0.01 0.00 0.00 0.01 0.00
0.02/0.07 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.02/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00
0.02/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00
0.02/0.07 c Propagators : Time Calls Cutoffs DomReds
0.02/0.07 c vbounds : 0.00 3 0 0
0.02/0.07 c rootredcost : 0.00 0 0 0
0.02/0.07 c pseudoobj : 0.00 6 0 0
0.02/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.02/0.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.07 c applied globally : - - - 0 0.0 - - -
0.02/0.07 c applied locally : - - - 0 0.0 - - -
0.02/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.02/0.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 9)
0.02/0.07 c redcost : 0.00 11 0 5 0 0
0.02/0.07 c impliedbounds : 0.00 10 0 0 0 0
0.02/0.07 c intobj : 0.00 0 0 0 0 0
0.02/0.07 c cgmip : 0.00 0 0 0 0 0
0.02/0.07 c gomory : 0.00 10 0 0 203 0
0.02/0.07 c strongcg : 0.02 10 0 0 203 0
0.02/0.07 c cmir : 0.00 10 0 0 4 0
0.02/0.07 c flowcover : 0.00 10 0 0 6 0
0.02/0.07 c clique : 0.00 2 0 0 0 0
0.02/0.07 c zerohalf : 0.00 0 0 0 0 0
0.02/0.07 c mcf : 0.00 2 0 0 0 0
0.02/0.07 c rapidlearning : 0.00 0 0 0 0 0
0.02/0.07 c Pricers : Time Calls Vars
0.02/0.07 c problem variables: 0.00 0 0
0.02/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.02/0.07 c relpscost : 0.01 1 0 0 0 0 2
0.02/0.07 c pscost : 0.00 0 0 0 0 0 0
0.02/0.07 c inference : 0.00 0 0 0 0 0 0
0.02/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.02/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.02/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.02/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.02/0.07 c random : 0.00 0 0 0 0 0 0
0.02/0.07 c Primal Heuristics : Time Calls Found
0.02/0.07 c LP solutions : 0.00 - 0
0.02/0.07 c pseudo solutions : 0.00 - 0
0.02/0.07 c feaspump : 0.00 0 0
0.02/0.07 c rens : 0.00 0 0
0.02/0.07 c crossover : 0.00 0 0
0.02/0.07 c oneopt : 0.00 2 1
0.02/0.07 c trivial : 0.00 2 3
0.02/0.07 c simplerounding : 0.00 11 11
0.02/0.07 c zirounding : 0.00 1 1
0.02/0.07 c rounding : 0.00 11 1
0.02/0.07 c shifting : 0.00 11 7
0.02/0.07 c intshifting : 0.00 0 0
0.02/0.07 c twoopt : 0.00 0 0
0.02/0.07 c fixandinfer : 0.00 0 0
0.02/0.07 c coefdiving : 0.00 0 0
0.02/0.07 c pscostdiving : 0.00 0 0
0.02/0.07 c fracdiving : 0.00 0 0
0.02/0.07 c veclendiving : 0.00 0 0
0.02/0.07 c intdiving : 0.00 0 0
0.02/0.07 c actconsdiving : 0.00 0 0
0.02/0.07 c objpscostdiving : 0.00 0 0
0.02/0.07 c rootsoldiving : 0.00 0 0
0.02/0.07 c linesearchdiving : 0.00 0 0
0.02/0.07 c guideddiving : 0.00 0 0
0.02/0.07 c octane : 0.00 0 0
0.02/0.07 c rins : 0.00 0 0
0.02/0.07 c localbranching : 0.00 0 0
0.02/0.07 c mutation : 0.00 0 0
0.02/0.07 c dins : 0.00 0 0
0.02/0.07 c undercover : 0.00 0 0
0.02/0.07 c nlp : 0.00 0 0
0.02/0.07 c trysol : 0.00 0 0
0.02/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.02/0.07 c primal LP : 0.00 0 0 0.00 -
0.02/0.07 c dual LP : 0.01 12 65 5.42 6500.00
0.02/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.02/0.07 c barrier LP : 0.00 0 0 0.00 -
0.02/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.02/0.07 c strong branching : 0.01 10 84 8.40 8400.00
0.02/0.07 c (at root node) : - 10 84 8.40 -
0.02/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.02/0.07 c B&B Tree :
0.02/0.07 c number of runs : 2
0.02/0.07 c nodes : 1
0.02/0.07 c nodes (total) : 2
0.02/0.07 c nodes left : 0
0.02/0.07 c max depth : 0
0.02/0.07 c max depth (total): 0
0.02/0.07 c backtracks : 0 (0.0%)
0.02/0.07 c delayed cutoffs : 0
0.02/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.02/0.07 c avg switch length: 2.00
0.02/0.07 c switching time : 0.00
0.02/0.07 c Solution :
0.02/0.07 c Solutions found : 24 (5 improvements)
0.02/0.07 c First Solution : +3.40000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.02/0.07 c Primal Bound : +4.00000000000000e+00 (in run 2, after 1 nodes, 0.05 seconds, depth 0, found by <zirounding>)
0.02/0.07 c Dual Bound : +4.00000000000000e+00
0.02/0.07 c Gap : 0.00 %
0.02/0.07 c Root Dual Bound : +4.00000000000000e+00
0.02/0.07 c Root Iterations : 65
0.02/0.08 c Time complete: 0.07.