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-2665191-1276655180.opb>
0.00/0.01 c original problem has 56 variables (56 bin, 0 int, 0 impl, 0 cont) and 56 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 574 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 574 implications, 0 cliques
0.00/0.02 c presolved problem has 56 variables (56 bin, 0 int, 0 impl, 0 cont) and 56 constraints
0.00/0.02 c 46 constraints of type <and>
0.00/0.02 c 10 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 # 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 # 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 # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c heuristics/undercover/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
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 0.0s| 1 | 0 | 20 | - | 375k| 0 | 20 | 56 | 56 | 56 | 102 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 o 7
0.00/0.02 c s 0.0s| 1 | 0 | 20 | - | 376k| 0 | 20 | 56 | 56 | 56 | 102 | 0 | 0 | 0 | 0.000000e+00 | 7.000000e+00 | Inf
0.00/0.07 c 0.0s| 1 | 0 | 52 | - | 386k| 0 | 20 | 56 | 56 | 56 | 124 | 22 | 0 | 0 | 0.000000e+00 | 7.000000e+00 | Inf
0.00/0.07 o 3
0.00/0.07 c s 0.0s| 1 | 0 | 52 | - | 387k| 0 | 20 | 56 | 56 | 56 | 124 | 22 | 0 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.00/0.07 c 0.0s| 1 | 0 | 77 | - | 396k| 0 | 41 | 56 | 56 | 56 | 145 | 43 | 0 | 0 | 1.730769e+00 | 3.000000e+00 | 73.33%
0.00/0.08 c 0.1s| 1 | 0 | 87 | - | 400k| 0 | 0 | 56 | 51 | 56 | 139 | 48 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.08 c (run 1, node 1) restarting after 6 global fixings of integer variables
0.00/0.08 c
0.00/0.08 c (restart) converted 47 cuts from the global cut pool into linear constraints
0.00/0.08 c
0.00/0.08 c presolving:
0.00/0.09 c (round 1) 11 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 0 upgd conss, 574 impls, 2 clqs
0.00/0.09 c (round 2) 11 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 38 upgd conss, 574 impls, 2 clqs
0.00/0.10 c presolving (3 rounds):
0.00/0.10 c 11 deleted vars, 14 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 5 changed coefficients
0.00/0.10 c 574 implications, 2 cliques
0.00/0.10 c presolved problem has 45 variables (45 bin, 0 int, 0 impl, 0 cont) and 84 constraints
0.00/0.10 c 1 constraints of type <knapsack>
0.00/0.10 c 2 constraints of type <setppc>
0.00/0.10 c 36 constraints of type <and>
0.00/0.10 c 45 constraints of type <logicor>
0.00/0.10 c transformed objective value is always integral (scale: 1)
0.00/0.10 c Presolving Time: 0.02
0.00/0.10 c
0.00/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.00/0.10 c 0.1s| 1 | 0 | 141 | - | 408k| 0 | 12 | 45 | 84 | 45 | 120 | 0 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.10 o 2
0.00/0.10 c s 0.1s| 1 | 0 | 141 | - | 409k| 0 | - | 45 | 84 | 45 | 120 | 0 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.10 c 0.1s| 1 | 0 | 141 | - | 409k| 0 | - | 45 | 84 | 45 | 120 | 0 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.10 c
0.00/0.10 c SCIP Status : problem is solved [optimal solution found]
0.00/0.10 c Solving Time (sec) : 0.06
0.00/0.10 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.00/0.10 c Primal Bound : +2.00000000000000e+00 (3 solutions)
0.00/0.10 c Dual Bound : +2.00000000000000e+00
0.00/0.10 c Gap : 0.00 %
0.00/0.10 s OPTIMUM FOUND
0.00/0.10 v -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 -x2 x1
0.00/0.10 c SCIP Status : problem is solved [optimal solution found]
0.00/0.10 c Solving Time : 0.06
0.00/0.10 c Original Problem :
0.00/0.10 c Problem name : HOME/instance-2665191-1276655180.opb
0.00/0.10 c Variables : 56 (56 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.10 c Constraints : 56 initial, 56 maximal
0.00/0.10 c Presolved Problem :
0.00/0.10 c Problem name : t_HOME/instance-2665191-1276655180.opb
0.00/0.10 c Variables : 45 (45 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.10 c Constraints : 84 initial, 84 maximal
0.00/0.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.10 c trivial : 0.00 6 0 0 0 0 0 0 0
0.00/0.10 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c probing : 0.01 0 0 0 0 0 0 0 0
0.00/0.10 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c setppc : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c and : 0.00 0 5 0 0 0 5 0 5
0.00/0.10 c linear : 0.00 0 0 0 0 0 9 0 0
0.00/0.10 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.10 c root node : - 6 - - 6 - - - -
0.00/0.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.10 c integral : 0 0 0 1 0 0 0 0 0 0
0.00/0.10 c knapsack : 1 0 1 0 0 0 0 0 0 0
0.00/0.10 c setppc : 2 0 1 0 0 0 0 0 0 0
0.00/0.10 c and : 36 4 116 1 0 0 5 44 0 0
0.00/0.10 c logicor : 45 4 114 1 0 0 0 0 0 0
0.00/0.10 c countsols : 0 0 0 1 0 0 0 0 0 0
0.00/0.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.10 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.10 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.00/0.10 c setppc : 0.00 0.00 0.00 0.00 0.00
0.00/0.10 c and : 0.00 0.00 0.00 0.00 0.00
0.00/0.10 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.10 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.10 c Propagators : Time Calls Cutoffs DomReds
0.00/0.10 c vbounds : 0.00 3 0 0
0.00/0.10 c rootredcost : 0.00 0 0 0
0.00/0.10 c pseudoobj : 0.00 7 0 0
0.00/0.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.10 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.10 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.10 c applied globally : - - - 0 0.0 - - -
0.00/0.10 c applied locally : - - - 0 0.0 - - -
0.00/0.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.10 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.10 c redcost : 0.00 4 0 1 0 0
0.00/0.10 c impliedbounds : 0.00 3 0 0 44 0
0.00/0.10 c intobj : 0.00 0 0 0 0 0
0.00/0.10 c cgmip : 0.00 0 0 0 0 0
0.00/0.10 c gomory : 0.01 3 0 0 185 0
0.00/0.10 c strongcg : 0.01 3 0 0 185 0
0.00/0.10 c cmir : 0.00 3 0 0 42 0
0.00/0.10 c flowcover : 0.00 3 0 0 88 0
0.00/0.10 c clique : 0.00 3 0 0 3 0
0.00/0.10 c zerohalf : 0.00 0 0 0 0 0
0.00/0.10 c mcf : 0.00 1 0 0 0 0
0.00/0.10 c rapidlearning : 0.01 1 0 0 0 0
0.00/0.10 c Pricers : Time Calls Vars
0.00/0.10 c problem variables: 0.00 0 0
0.00/0.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.10 c pscost : 0.00 0 0 0 0 0 0
0.00/0.10 c inference : 0.00 0 0 0 0 0 0
0.00/0.10 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.10 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.10 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.10 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.10 c random : 0.00 0 0 0 0 0 0
0.00/0.10 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.10 c Primal Heuristics : Time Calls Found
0.00/0.10 c LP solutions : 0.00 - 0
0.00/0.10 c pseudo solutions : 0.00 - 0
0.00/0.10 c feaspump : 0.00 0 0
0.00/0.10 c undercover : 0.01 1 0
0.00/0.10 c oneopt : 0.00 2 0
0.00/0.10 c trivial : 0.00 2 0
0.00/0.10 c simplerounding : 0.00 0 0
0.00/0.10 c zirounding : 0.00 0 0
0.00/0.10 c rounding : 0.00 4 0
0.00/0.10 c shifting : 0.00 4 3
0.00/0.10 c intshifting : 0.00 0 0
0.00/0.10 c twoopt : 0.00 0 0
0.00/0.10 c fixandinfer : 0.00 0 0
0.00/0.10 c coefdiving : 0.00 0 0
0.00/0.10 c pscostdiving : 0.00 0 0
0.00/0.10 c fracdiving : 0.00 0 0
0.00/0.10 c veclendiving : 0.00 0 0
0.00/0.10 c intdiving : 0.00 0 0
0.00/0.10 c actconsdiving : 0.00 0 0
0.00/0.10 c objpscostdiving : 0.00 0 0
0.00/0.10 c rootsoldiving : 0.00 0 0
0.00/0.10 c linesearchdiving : 0.00 0 0
0.00/0.10 c guideddiving : 0.00 0 0
0.00/0.10 c octane : 0.00 0 0
0.00/0.10 c rens : 0.00 0 0
0.00/0.10 c rins : 0.00 0 0
0.00/0.10 c localbranching : 0.00 0 0
0.00/0.10 c mutation : 0.00 0 0
0.00/0.10 c crossover : 0.00 0 0
0.00/0.10 c dins : 0.00 0 0
0.00/0.10 c nlp : 0.00 0 0
0.00/0.10 c trysol : 0.00 0 0
0.00/0.10 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.10 c primal LP : 0.00 0 0 0.00 -
0.00/0.10 c dual LP : 0.00 5 141 28.20 -
0.00/0.10 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.10 c barrier LP : 0.00 0 0 0.00 -
0.00/0.10 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.10 c strong branching : 0.00 0 0 0.00 -
0.00/0.10 c (at root node) : - 0 0 0.00 -
0.00/0.10 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.10 c B&B Tree :
0.00/0.10 c number of runs : 2
0.00/0.10 c nodes : 1
0.00/0.10 c nodes (total) : 2
0.00/0.10 c nodes left : 0
0.00/0.10 c max depth : 0
0.00/0.10 c max depth (total): 0
0.00/0.10 c backtracks : 0 (0.0%)
0.00/0.10 c delayed cutoffs : 0
0.00/0.10 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.10 c avg switch length: 2.00
0.00/0.10 c switching time : 0.00
0.00/0.10 c Solution :
0.00/0.10 c Solutions found : 3 (3 improvements)
0.00/0.10 c First Solution : +7.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <shifting>)
0.00/0.10 c Primal Bound : +2.00000000000000e+00 (in run 2, after 1 nodes, 0.06 seconds, depth 0, found by <shifting>)
0.00/0.10 c Dual Bound : +2.00000000000000e+00
0.00/0.10 c Gap : 0.00 %
0.00/0.10 c Root Dual Bound : +2.00000000000000e+00
0.00/0.10 c Root Iterations : 141
0.10/0.11 c Time complete: 0.1.