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-2663693-1276650277.opb>
0.00/0.01 c original problem has 80 variables (80 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 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.01 c presolving:
0.01/0.01 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 0 upgd conss, 244 impls, 0 clqs
0.01/0.02 c (round 2) 16 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 17 chg coeffs, 0 upgd conss, 378 impls, 0 clqs
0.01/0.02 c (round 3) 26 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 3 upgd conss, 378 impls, 0 clqs
0.01/0.03 c presolving (4 rounds):
0.01/0.03 c 26 deleted vars, 16 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 25 changed coefficients
0.01/0.03 c 390 implications, 0 cliques
0.01/0.03 c presolved problem has 54 variables (54 bin, 0 int, 0 impl, 0 cont) and 37 constraints
0.01/0.03 c 30 constraints of type <and>
0.01/0.03 c 2 constraints of type <linear>
0.01/0.03 c 5 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 2)
0.01/0.03 c Presolving Time: 0.01
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1800
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c lp/solvefreq = -1
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c heuristics/undercover/freq = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.03 c 0.0s| 1 | 2 | 0 | - | 291k| 0 | - | 54 | 37 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.01/0.03 o 5
0.01/0.03 c * 0.0s| 53 | 17 | 0 | 0.0 | 309k| 11 | - | 54 | 42 | 0 | 0 | 0 | 5 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
0.01/0.04 o 3
0.01/0.04 c * 0.0s| 94 | 0 | 0 | 0.0 | 314k| 11 | - | 54 | 59 | 0 | 0 | 0 | 22 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.01/0.04 c
0.01/0.04 c SCIP Status : problem is solved [optimal solution found]
0.01/0.04 c Solving Time (sec) : 0.02
0.01/0.04 c Solving Nodes : 94
0.01/0.04 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.01/0.04 c Dual Bound : +3.00000000000000e+00
0.01/0.04 c Gap : 0.00 %
0.01/0.04 s OPTIMUM FOUND
0.01/0.04 v -x30 -x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 x16 -x15 x14 x13 x12 x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2
0.01/0.04 v x1
0.01/0.04 c SCIP Status : problem is solved [optimal solution found]
0.01/0.04 c Solving Time : 0.02
0.01/0.04 c Original Problem :
0.01/0.04 c Problem name : HOME/instance-2663693-1276650277.opb
0.01/0.04 c Variables : 80 (80 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.04 c Constraints : 55 initial, 55 maximal
0.01/0.04 c Presolved Problem :
0.01/0.04 c Problem name : t_HOME/instance-2663693-1276650277.opb
0.01/0.04 c Variables : 54 (54 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.04 c Constraints : 37 initial, 59 maximal
0.01/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.01/0.04 c trivial : 0.00 0 0 0 0 0 0 0 0
0.01/0.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.01/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.01/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.01/0.04 c implics : 0.00 0 0 0 0 0 0 0 0
0.01/0.04 c probing : 0.01 0 0 0 0 0 0 0 0
0.01/0.04 c and : 0.00 4 16 0 0 0 16 0 16
0.01/0.04 c linear : 0.00 3 3 0 0 0 0 0 9
0.01/0.04 c logicor : 0.00 0 0 0 0 0 0 0 0
0.01/0.04 c root node : - 0 - - 0 - - - -
0.01/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.01/0.04 c integral : 0 0 0 0 0 0 0 0 0 0
0.01/0.04 c and : 30 0 319 0 73 8 278 0 0 0
0.01/0.04 c linear : 2 0 309 0 73 11 169 0 0 0
0.01/0.04 c logicor : 5+ 0 108 0 70 2 28 0 0 0
0.01/0.04 c countsols : 0 0 0 0 75 0 0 0 0 0
0.01/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.01/0.04 c integral : 0.00 0.00 0.00 0.00 0.00
0.01/0.04 c and : 0.00 0.00 0.00 0.00 0.00
0.01/0.04 c linear : 0.02 0.00 0.02 0.00 0.00
0.01/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00
0.01/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00
0.01/0.04 c Propagators : Time Calls Cutoffs DomReds
0.01/0.04 c vbounds : 0.00 2 0 0
0.01/0.04 c rootredcost : 0.00 0 0 0
0.01/0.04 c pseudoobj : 0.00 205 0 20
0.01/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.01/0.04 c propagation : 0.00 21 14 54 13.3 3 14.3 -
0.01/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.04 c applied globally : - - - 22 9.7 - - -
0.01/0.04 c applied locally : - - - 0 0.0 - - -
0.01/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.01/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.01/0.04 c redcost : 0.00 0 0 0 0 0
0.01/0.04 c impliedbounds : 0.00 0 0 0 0 0
0.01/0.04 c intobj : 0.00 0 0 0 0 0
0.01/0.04 c cgmip : 0.00 0 0 0 0 0
0.01/0.04 c gomory : 0.00 0 0 0 0 0
0.01/0.04 c strongcg : 0.00 0 0 0 0 0
0.01/0.04 c cmir : 0.00 0 0 0 0 0
0.01/0.04 c flowcover : 0.00 0 0 0 0 0
0.01/0.04 c clique : 0.00 0 0 0 0 0
0.01/0.04 c zerohalf : 0.00 0 0 0 0 0
0.01/0.04 c mcf : 0.00 0 0 0 0 0
0.01/0.04 c rapidlearning : 0.00 0 0 0 0 0
0.01/0.04 c Pricers : Time Calls Vars
0.01/0.04 c problem variables: 0.00 0 0
0.01/0.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.01/0.04 c relpscost : 0.00 0 0 0 0 0 0
0.01/0.04 c pscost : 0.00 0 0 0 0 0 0
0.01/0.04 c inference : 0.00 73 0 0 0 0 146
0.01/0.04 c mostinf : 0.00 0 0 0 0 0 0
0.01/0.04 c leastinf : 0.00 0 0 0 0 0 0
0.01/0.04 c fullstrong : 0.00 0 0 0 0 0 0
0.01/0.04 c allfullstrong : 0.00 0 0 0 0 0 0
0.01/0.04 c random : 0.00 0 0 0 0 0 0
0.01/0.04 c Primal Heuristics : Time Calls Found
0.01/0.04 c LP solutions : 0.00 - 0
0.01/0.04 c pseudo solutions : 0.00 - 2
0.01/0.04 c oneopt : 0.00 0 0
0.01/0.04 c trivial : 0.00 2 0
0.01/0.04 c simplerounding : 0.00 0 0
0.01/0.04 c zirounding : 0.00 0 0
0.01/0.04 c rounding : 0.00 0 0
0.01/0.04 c shifting : 0.00 0 0
0.01/0.04 c intshifting : 0.00 0 0
0.01/0.04 c twoopt : 0.00 0 0
0.01/0.04 c fixandinfer : 0.00 0 0
0.01/0.04 c feaspump : 0.00 0 0
0.01/0.04 c coefdiving : 0.00 0 0
0.01/0.04 c pscostdiving : 0.00 0 0
0.01/0.04 c fracdiving : 0.00 0 0
0.01/0.04 c veclendiving : 0.00 0 0
0.01/0.04 c intdiving : 0.00 0 0
0.01/0.04 c actconsdiving : 0.00 0 0
0.01/0.04 c objpscostdiving : 0.00 0 0
0.01/0.04 c rootsoldiving : 0.00 0 0
0.01/0.04 c linesearchdiving : 0.00 0 0
0.01/0.04 c guideddiving : 0.00 0 0
0.01/0.04 c octane : 0.00 0 0
0.01/0.04 c rens : 0.00 0 0
0.01/0.04 c rins : 0.00 0 0
0.01/0.04 c localbranching : 0.00 0 0
0.01/0.04 c mutation : 0.00 0 0
0.01/0.04 c crossover : 0.00 0 0
0.01/0.04 c dins : 0.00 0 0
0.01/0.04 c undercover : 0.00 0 0
0.01/0.04 c nlp : 0.00 0 0
0.01/0.04 c trysol : 0.00 0 0
0.01/0.04 c LP : Time Calls Iterations Iter/call Iter/sec
0.01/0.04 c primal LP : 0.00 0 0 0.00 -
0.01/0.04 c dual LP : 0.00 0 0 0.00 -
0.01/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.01/0.04 c barrier LP : 0.00 0 0 0.00 -
0.01/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.01/0.04 c strong branching : 0.00 0 0 0.00 -
0.01/0.04 c (at root node) : - 0 0 0.00 -
0.01/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.01/0.04 c B&B Tree :
0.01/0.04 c number of runs : 1
0.01/0.04 c nodes : 94
0.01/0.04 c nodes (total) : 94
0.01/0.04 c nodes left : 0
0.01/0.04 c max depth : 11
0.01/0.04 c max depth (total): 11
0.01/0.04 c backtracks : 24 (25.5%)
0.01/0.04 c delayed cutoffs : 2
0.01/0.04 c repropagations : 6 (15 domain reductions, 2 cutoffs)
0.01/0.04 c avg switch length: 3.72
0.01/0.04 c switching time : 0.00
0.01/0.04 c Solution :
0.01/0.04 c Solutions found : 2 (2 improvements)
0.01/0.04 c First Solution : +5.00000000000000e+00 (in run 1, after 53 nodes, 0.01 seconds, depth 11, found by <relaxation>)
0.01/0.04 c Primal Bound : +3.00000000000000e+00 (in run 1, after 94 nodes, 0.02 seconds, depth 9, found by <relaxation>)
0.01/0.04 c Dual Bound : +3.00000000000000e+00
0.01/0.04 c Gap : 0.00 %
0.01/0.04 c Root Dual Bound : +1.00000000000000e+00
0.01/0.04 c Root Iterations : 0
0.01/0.04 c Time complete: 0.04.