0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2699494-1278533772.wbo>
0.00/0.00 c original problem has 136 variables (76 bin, 0 int, 0 impl, 60 cont) and 125 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 52 del vars, 0 del conss, 52 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 60 impls, 4 clqs
0.00/0.00 c (round 2) 104 del vars, 52 del conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 164 impls, 4 clqs
0.00/0.01 c (round 3) 104 del vars, 52 del conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 164 impls, 4 clqs
0.00/0.01 c (round 4) 119 del vars, 52 del conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 261 impls, 0 clqs
0.00/0.01 c (round 5) 119 del vars, 106 del conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 261 impls, 0 clqs
0.00/0.01 c (round 6) 125 del vars, 112 del conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 261 impls, 0 clqs
0.00/0.01 c (round 7) 131 del vars, 113 del conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 261 impls, 0 clqs
0.00/0.01 c presolving (8 rounds):
0.00/0.01 c 131 deleted vars, 113 deleted constraints, 60 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 261 implications, 0 cliques
0.00/0.01 c presolved problem has 5 variables (3 bin, 0 int, 0 impl, 2 cont) and 16 constraints
0.00/0.01 c 2 constraints of type <indicator>
0.00/0.01 c 2 constraints of type <varbound>
0.00/0.01 c 12 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.2
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 = 1800
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 = 3420
0.00/0.01 c
0.00/0.01 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c lp/solvefreq = -1
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 # 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 o 2
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 | 0 | - | 487k| 0 | - | 5 | 16 | 0 | 0 | 0 | 0 | 0 | -- | 2.000000e+00 | Inf
0.00/0.01 c 0.0s| 1 | 2 | 0 | - | 486k| 0 | - | 5 | 16 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 2.000000e+00 | Inf
0.00/0.01 o 0
0.00/0.01 c * 0.0s| 3 | 0 | 0 | 0.0 | 485k| 1 | - | 5 | 14 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.00/0.01 c
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Solving Time (sec) : 0.00
0.00/0.01 c Solving Nodes : 3
0.00/0.01 c Primal Bound : +0.00000000000000e+00 (3 solutions)
0.00/0.01 c Dual Bound : +0.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -x16 -x15 x14 -x13 x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 x3 -x2 -x1
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Solving Time : 0.00
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-2699494-1278533772.wbo
0.00/0.01 c Variables : 136 (76 binary, 0 integer, 0 implicit integer, 60 continuous)
0.00/0.01 c Constraints : 125 initial, 125 maximal
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-2699494-1278533772.wbo
0.00/0.01 c Variables : 5 (3 binary, 0 integer, 0 implicit integer, 2 continuous)
0.00/0.01 c Constraints : 16 initial, 16 maximal
0.00/0.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.01 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c dualfix : 0.00 12 0 0 0 0 0 0 0
0.00/0.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c probing : 0.00 8 7 0 0 0 0 0 0
0.00/0.01 c indicator : 0.00 52 0 0 0 0 58 0 0
0.00/0.01 c varbound : 0.00 0 0 0 0 0 6 0 0
0.00/0.01 c knapsack : 0.00 0 0 0 0 0 1 0 0
0.00/0.01 c setppc : 0.00 0 0 0 0 0 8 0 0
0.00/0.01 c linear : 0.00 52 0 0 60 0 0 0 0
0.00/0.01 c logicor : 0.00 0 0 0 0 0 40 0 0
0.00/0.01 c root node : - 1 - - 1 - - - -
0.00/0.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.01 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c indicator : 2 0 57 0 2 1 1 0 0 0
0.00/0.01 c varbound : 2 0 56 0 1 0 1 0 0 0
0.00/0.01 c logicor : 12 0 32 0 1 6 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 2 0 0 0 0 0
0.00/0.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.01 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c indicator : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c varbound : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Propagators : Time Calls Cutoffs DomReds
0.00/0.01 c vbounds : 0.00 4 0 1
0.00/0.01 c rootredcost : 0.00 0 0 0
0.00/0.01 c pseudoobj : 0.00 4 0 1
0.00/0.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.01 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.01 c applied globally : - - - 0 0.0 - - -
0.00/0.01 c applied locally : - - - 0 0.0 - - -
0.00/0.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.01 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.01 c redcost : 0.00 0 0 0 0 0
0.00/0.01 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.01 c intobj : 0.00 0 0 0 0 0
0.00/0.01 c cgmip : 0.00 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0 0 0 0 0
0.00/0.01 c strongcg : 0.00 0 0 0 0 0
0.00/0.01 c cmir : 0.00 0 0 0 0 0
0.00/0.01 c flowcover : 0.00 0 0 0 0 0
0.00/0.01 c clique : 0.00 0 0 0 0 0
0.00/0.01 c zerohalf : 0.00 0 0 0 0 0
0.00/0.01 c mcf : 0.00 0 0 0 0 0
0.00/0.01 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.01 c Pricers : Time Calls Vars
0.00/0.01 c problem variables: 0.00 0 0
0.00/0.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.01 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.01 c pscost : 0.00 0 0 0 0 0 0
0.00/0.01 c inference : 0.00 1 0 0 0 0 2
0.00/0.01 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.01 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.01 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.01 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.01 c random : 0.00 0 0 0 0 0 0
0.00/0.01 c Primal Heuristics : Time Calls Found
0.00/0.01 c LP solutions : 0.00 - 0
0.00/0.01 c pseudo solutions : 0.00 - 1
0.00/0.01 c oneopt : 0.00 0 0
0.00/0.01 c trivial : 0.00 2 2
0.00/0.01 c simplerounding : 0.00 0 0
0.00/0.01 c zirounding : 0.00 0 0
0.00/0.01 c rounding : 0.00 0 0
0.00/0.01 c shifting : 0.00 0 0
0.00/0.01 c intshifting : 0.00 0 0
0.00/0.01 c twoopt : 0.00 0 0
0.00/0.01 c fixandinfer : 0.00 0 0
0.00/0.01 c feaspump : 0.00 0 0
0.00/0.01 c coefdiving : 0.00 0 0
0.00/0.01 c pscostdiving : 0.00 0 0
0.00/0.01 c fracdiving : 0.00 0 0
0.00/0.01 c veclendiving : 0.00 0 0
0.00/0.01 c intdiving : 0.00 0 0
0.00/0.01 c actconsdiving : 0.00 0 0
0.00/0.01 c objpscostdiving : 0.00 0 0
0.00/0.01 c rootsoldiving : 0.00 0 0
0.00/0.01 c linesearchdiving : 0.00 0 0
0.00/0.01 c guideddiving : 0.00 0 0
0.00/0.01 c octane : 0.00 0 0
0.00/0.01 c rens : 0.00 0 0
0.00/0.01 c rins : 0.00 0 0
0.00/0.01 c localbranching : 0.00 0 0
0.00/0.01 c mutation : 0.00 0 0
0.00/0.01 c crossover : 0.00 0 0
0.00/0.01 c dins : 0.00 0 0
0.00/0.01 c undercover : 0.00 0 0
0.00/0.01 c nlp : 0.00 0 0
0.00/0.01 c trysol : 0.00 0 0
0.00/0.01 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.01 c primal LP : 0.00 0 0 0.00 -
0.00/0.01 c dual LP : 0.00 0 0 0.00 -
0.00/0.01 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.01 c barrier LP : 0.00 0 0 0.00 -
0.00/0.01 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.01 c strong branching : 0.00 0 0 0.00 -
0.00/0.01 c (at root node) : - 0 0 0.00 -
0.00/0.01 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.01 c B&B Tree :
0.00/0.01 c number of runs : 1
0.00/0.01 c nodes : 3
0.00/0.01 c nodes (total) : 3
0.00/0.01 c nodes left : 0
0.00/0.01 c max depth : 1
0.00/0.01 c max depth (total): 1
0.00/0.01 c backtracks : 0 (0.0%)
0.00/0.01 c delayed cutoffs : 0
0.00/0.01 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.01 c avg switch length: 2.00
0.00/0.01 c switching time : 0.00
0.00/0.01 c Solution :
0.00/0.01 c Solutions found : 3 (2 improvements)
0.00/0.01 c First Solution : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.01 c Primal Bound : +0.00000000000000e+00 (in run 1, after 3 nodes, 0.00 seconds, depth 1, found by <relaxation>)
0.00/0.01 c Dual Bound : +0.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Root Dual Bound : +0.00000000000000e+00
0.00/0.01 c Root Iterations : 0
0.00/0.01 c Time complete: 0.01.