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-2665068-1276648851.opb>
0.00/0.01 c original problem has 210 variables (210 bin, 0 int, 0 impl, 0 cont) and 154 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.03 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 0 upgd conss, 684 impls, 0 clqs
0.00/0.03 c (round 2) 17 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 4 upgd conss, 1020 impls, 0 clqs
0.00/0.03 c (round 3) 31 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 4 upgd conss, 1188 impls, 0 clqs
0.03/0.04 c (round 4) 45 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 4 upgd conss, 1188 impls, 0 clqs
0.03/0.05 c (0.0s) probing: 132/165 (80.0%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.03/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.05 c presolving (5 rounds):
0.03/0.05 c 45 deleted vars, 36 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 56 changed coefficients
0.03/0.05 c 1200 implications, 0 cliques
0.03/0.05 c presolved problem has 165 variables (165 bin, 0 int, 0 impl, 0 cont) and 115 constraints
0.03/0.05 c 108 constraints of type <and>
0.03/0.05 c 3 constraints of type <linear>
0.03/0.05 c 4 constraints of type <logicor>
0.03/0.05 c transformed objective value is always integral (scale: 2)
0.03/0.05 c Presolving Time: 0.03
0.03/0.05 c - non default parameters ----------------------------------------------------------------------
0.03/0.05 c # SCIP version 1.2.1.2
0.03/0.05 c
0.03/0.05 c # frequency for displaying node information lines
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.05 c display/freq = 10000
0.03/0.05 c
0.03/0.05 c # maximal time in seconds to run
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/time = 1800
0.03/0.05 c
0.03/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/memory = 1620
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify inequalities
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/linear/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify knapsacks
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c heuristics/undercover/freq = 0
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/rapidlearning/freq = 0
0.03/0.05 c
0.03/0.05 c -----------------------------------------------------------------------------------------------
0.03/0.05 c start solving
0.03/0.05 c
0.03/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.05 c 0.0s| 1 | 0 | 10 | - | 847k| 0 | 5 | 165 | 115 | 165 | 223 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.12 o 3
0.09/0.12 c u 0.1s| 1 | 0 | 10 | - | 859k| 0 | - | 165 | 115 | 165 | 223 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.12 c 0.1s| 1 | 0 | 10 | - | 856k| 0 | - | 165 | 115 | 165 | 223 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.12 c
0.09/0.12 c SCIP Status : problem is solved [optimal solution found]
0.09/0.12 c Solving Time (sec) : 0.07
0.09/0.12 c Solving Nodes : 1
0.09/0.12 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.09/0.12 c Dual Bound : +3.00000000000000e+00
0.09/0.12 c Gap : 0.00 %
0.09/0.12 s OPTIMUM FOUND
0.09/0.12 v -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 x50 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x49 -x48 -x47 -x46 -x45
0.09/0.12 v -x44 x43 -x35 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
0.09/0.12 v -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.09/0.12 c SCIP Status : problem is solved [optimal solution found]
0.09/0.12 c Solving Time : 0.07
0.09/0.12 c Original Problem :
0.09/0.12 c Problem name : HOME/instance-2665068-1276648851.opb
0.09/0.12 c Variables : 210 (210 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.12 c Constraints : 154 initial, 154 maximal
0.09/0.12 c Presolved Problem :
0.09/0.12 c Problem name : t_HOME/instance-2665068-1276648851.opb
0.09/0.12 c Variables : 165 (165 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.12 c Constraints : 115 initial, 115 maximal
0.09/0.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.12 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c probing : 0.01 0 0 0 0 0 0 0 0
0.09/0.12 c and : 0.01 6 36 0 0 0 36 0 36
0.09/0.12 c linear : 0.00 1 2 0 0 0 0 0 20
0.09/0.12 c logicor : 0.00 0 0 0 0 0 0 0 0
0.09/0.12 c root node : - 0 - - 0 - - - -
0.09/0.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.12 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.12 c and : 108 0 301 0 0 0 0 0 0 0
0.09/0.12 c linear : 3 0 301 0 0 0 0 0 0 0
0.09/0.12 c logicor : 4 0 65 0 0 0 0 0 0 0
0.09/0.12 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.12 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c and : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c linear : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c Propagators : Time Calls Cutoffs DomReds
0.09/0.12 c vbounds : 0.00 2 0 0
0.09/0.12 c rootredcost : 0.00 0 0 0
0.09/0.12 c pseudoobj : 0.00 34 0 0
0.09/0.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.12 c applied globally : - - - 0 0.0 - - -
0.09/0.12 c applied locally : - - - 0 0.0 - - -
0.09/0.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.12 c redcost : 0.00 0 0 0 0 0
0.09/0.12 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.12 c intobj : 0.00 0 0 0 0 0
0.09/0.12 c cgmip : 0.00 0 0 0 0 0
0.09/0.12 c gomory : 0.00 0 0 0 0 0
0.09/0.12 c strongcg : 0.00 0 0 0 0 0
0.09/0.12 c cmir : 0.00 0 0 0 0 0
0.09/0.12 c flowcover : 0.00 0 0 0 0 0
0.09/0.12 c clique : 0.00 0 0 0 0 0
0.09/0.12 c zerohalf : 0.00 0 0 0 0 0
0.09/0.12 c mcf : 0.00 0 0 0 0 0
0.09/0.12 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.12 c Pricers : Time Calls Vars
0.09/0.12 c problem variables: 0.00 0 0
0.09/0.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.12 c pscost : 0.00 0 0 0 0 0 0
0.09/0.12 c inference : 0.00 0 0 0 0 0 0
0.09/0.12 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.12 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.12 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.12 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.12 c random : 0.00 0 0 0 0 0 0
0.09/0.12 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.12 c Primal Heuristics : Time Calls Found
0.09/0.12 c LP solutions : 0.00 - 0
0.09/0.12 c pseudo solutions : 0.00 - 0
0.09/0.12 c oneopt : 0.00 0 0
0.09/0.12 c trivial : 0.00 2 0
0.09/0.12 c simplerounding : 0.00 0 0
0.09/0.12 c zirounding : 0.00 0 0
0.09/0.12 c rounding : 0.00 1 0
0.09/0.12 c shifting : 0.00 1 0
0.09/0.12 c intshifting : 0.00 0 0
0.09/0.12 c twoopt : 0.00 0 0
0.09/0.12 c fixandinfer : 0.00 0 0
0.09/0.12 c feaspump : 0.00 1 0
0.09/0.12 c coefdiving : 0.00 0 0
0.09/0.12 c pscostdiving : 0.00 0 0
0.09/0.12 c fracdiving : 0.00 0 0
0.09/0.12 c veclendiving : 0.00 0 0
0.09/0.12 c intdiving : 0.00 0 0
0.09/0.12 c actconsdiving : 0.00 0 0
0.09/0.12 c objpscostdiving : 0.00 0 0
0.09/0.12 c rootsoldiving : 0.00 0 0
0.09/0.12 c linesearchdiving : 0.00 0 0
0.09/0.12 c guideddiving : 0.00 0 0
0.09/0.12 c octane : 0.00 0 0
0.09/0.12 c rens : 0.00 0 0
0.09/0.12 c rins : 0.00 0 0
0.09/0.12 c localbranching : 0.00 0 0
0.09/0.12 c mutation : 0.00 0 0
0.09/0.12 c crossover : 0.00 0 0
0.09/0.12 c dins : 0.00 0 0
0.09/0.12 c undercover : 0.04 1 1
0.09/0.12 c nlp : 0.00 0 0
0.09/0.12 c trysol : 0.00 0 0
0.09/0.12 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.12 c primal LP : 0.00 0 0 0.00 -
0.09/0.12 c dual LP : 0.00 1 10 10.00 -
0.09/0.12 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.12 c barrier LP : 0.00 0 0 0.00 -
0.09/0.12 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.12 c strong branching : 0.00 0 0 0.00 -
0.09/0.12 c (at root node) : - 0 0 0.00 -
0.09/0.12 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.12 c B&B Tree :
0.09/0.12 c number of runs : 1
0.09/0.12 c nodes : 1
0.09/0.12 c nodes (total) : 1
0.09/0.12 c nodes left : 0
0.09/0.12 c max depth : 0
0.09/0.12 c max depth (total): 0
0.09/0.12 c backtracks : 0 (0.0%)
0.09/0.12 c delayed cutoffs : 0
0.09/0.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.12 c avg switch length: 2.00
0.09/0.12 c switching time : 0.00
0.09/0.12 c Solution :
0.09/0.12 c Solutions found : 1 (1 improvements)
0.09/0.12 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <undercover>)
0.09/0.12 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <undercover>)
0.09/0.12 c Dual Bound : +3.00000000000000e+00
0.09/0.12 c Gap : 0.00 %
0.09/0.12 c Root Dual Bound : +3.00000000000000e+00
0.09/0.12 c Root Iterations : 10
0.09/0.13 c Time complete: 0.13.