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-2663518-1276646111.opb>
0.00/0.01 c original problem has 108 variables (108 bin, 0 int, 0 impl, 0 cont) and 77 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.00/0.02 c (round 1) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 316 impls, 0 clqs
0.02/0.02 c (round 2) 14 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 22 chg coeffs, 3 upgd conss, 436 impls, 0 clqs
0.02/0.02 c (round 3) 26 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 3 upgd conss, 436 impls, 0 clqs
0.02/0.03 c presolving (4 rounds):
0.02/0.03 c 26 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 32 changed coefficients
0.02/0.03 c 448 implications, 0 cliques
0.02/0.03 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.02/0.03 c 50 constraints of type <and>
0.02/0.03 c 2 constraints of type <linear>
0.02/0.03 c 3 constraints of type <logicor>
0.02/0.03 c transformed objective value is always integral (scale: 2)
0.02/0.03 c Presolving Time: 0.01
0.02/0.03 c - non default parameters ----------------------------------------------------------------------
0.02/0.03 c # SCIP version 1.2.1.2
0.02/0.03 c
0.02/0.03 c # frequency for displaying node information lines
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.03 c display/freq = 10000
0.02/0.03 c
0.02/0.03 c # maximal time in seconds to run
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/time = 1800
0.02/0.03 c
0.02/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/memory = 1620
0.02/0.03 c
0.02/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c lp/solvefreq = -1
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify inequalities
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/linear/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify knapsacks
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c heuristics/undercover/freq = 0
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/rapidlearning/freq = 0
0.02/0.03 c
0.02/0.03 c -----------------------------------------------------------------------------------------------
0.02/0.03 c start solving
0.02/0.03 c
0.02/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.02/0.03 c 0.0s| 1 | 2 | 0 | - | 364k| 0 | - | 82 | 55 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.02/0.04 o 5
0.02/0.04 c * 0.0s| 68 | 39 | 0 | 0.0 | 398k| 15 | - | 82 | 70 | 0 | 0 | 0 | 16 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
0.02/0.05 o 3
0.02/0.05 c * 0.0s| 144 | 3 | 0 | 0.0 | 393k| 15 | - | 82 | 67 | 0 | 0 | 0 | 33 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.02/0.05 c
0.02/0.05 c SCIP Status : problem is solved [optimal solution found]
0.02/0.05 c Solving Time (sec) : 0.03
0.02/0.05 c Solving Nodes : 144
0.02/0.05 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.02/0.05 c Dual Bound : +3.00000000000000e+00
0.02/0.05 c Gap : 0.00 %
0.02/0.05 s OPTIMUM FOUND
0.02/0.05 v -x36 -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.02/0.05 v x9 -x8 x7 -x6 -x5 -x4 -x3 x2 x1
0.02/0.05 c SCIP Status : problem is solved [optimal solution found]
0.02/0.05 c Solving Time : 0.03
0.02/0.05 c Original Problem :
0.02/0.05 c Problem name : HOME/instance-2663518-1276646111.opb
0.02/0.05 c Variables : 108 (108 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.05 c Constraints : 77 initial, 77 maximal
0.02/0.05 c Presolved Problem :
0.02/0.05 c Problem name : t_HOME/instance-2663518-1276646111.opb
0.02/0.05 c Variables : 82 (82 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.05 c Constraints : 55 initial, 75 maximal
0.02/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.02/0.05 c trivial : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c implics : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c probing : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c and : 0.00 4 20 0 0 0 20 0 20
0.02/0.05 c linear : 0.01 1 1 0 0 0 0 0 12
0.02/0.05 c logicor : 0.00 0 0 0 0 0 0 0 0
0.02/0.05 c root node : - 29 - - 29 - - - -
0.02/0.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.02/0.05 c integral : 0 0 0 0 0 0 0 0 0 0
0.02/0.05 c and : 50 0 511 0 119 6 570 0 0 0
0.02/0.05 c linear : 2 0 504 0 119 21 236 0 0 0
0.02/0.05 c logicor : 3+ 0 175 0 119 5 46 0 0 0
0.02/0.05 c countsols : 0 0 0 0 120 0 0 0 0 0
0.02/0.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.02/0.05 c integral : 0.00 0.00 0.00 0.00 0.00
0.02/0.05 c and : 0.02 0.00 0.02 0.00 0.00
0.02/0.05 c linear : 0.00 0.00 0.00 0.00 0.00
0.02/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00
0.02/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00
0.02/0.05 c Propagators : Time Calls Cutoffs DomReds
0.02/0.05 c vbounds : 0.00 2 0 0
0.02/0.05 c rootredcost : 0.00 0 0 0
0.02/0.05 c pseudoobj : 0.00 342 1 51
0.02/0.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.02/0.05 c propagation : 0.00 33 32 185 20.3 0 0.0 -
0.02/0.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.05 c applied globally : - - - 32 7.2 - - -
0.02/0.05 c applied locally : - - - 1 34.0 - - -
0.02/0.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.02/0.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.02/0.05 c redcost : 0.00 0 0 0 0 0
0.02/0.05 c impliedbounds : 0.00 0 0 0 0 0
0.02/0.05 c intobj : 0.00 0 0 0 0 0
0.02/0.05 c cgmip : 0.00 0 0 0 0 0
0.02/0.05 c gomory : 0.00 0 0 0 0 0
0.02/0.05 c strongcg : 0.00 0 0 0 0 0
0.02/0.05 c cmir : 0.00 0 0 0 0 0
0.02/0.05 c flowcover : 0.00 0 0 0 0 0
0.02/0.05 c clique : 0.00 0 0 0 0 0
0.02/0.05 c zerohalf : 0.00 0 0 0 0 0
0.02/0.05 c mcf : 0.00 0 0 0 0 0
0.02/0.05 c rapidlearning : 0.00 0 0 0 0 0
0.02/0.05 c Pricers : Time Calls Vars
0.02/0.05 c problem variables: 0.00 0 0
0.02/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.02/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.02/0.05 c pscost : 0.00 0 0 0 0 0 0
0.02/0.05 c inference : 0.00 118 0 0 0 0 236
0.02/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.02/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.02/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.02/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.02/0.05 c random : 0.00 0 0 0 0 0 0
0.02/0.05 c Primal Heuristics : Time Calls Found
0.02/0.05 c LP solutions : 0.00 - 0
0.02/0.05 c pseudo solutions : 0.00 - 2
0.02/0.05 c oneopt : 0.00 0 0
0.02/0.05 c trivial : 0.00 2 0
0.02/0.05 c simplerounding : 0.00 0 0
0.02/0.05 c zirounding : 0.00 0 0
0.02/0.05 c rounding : 0.00 0 0
0.02/0.05 c shifting : 0.00 0 0
0.02/0.05 c intshifting : 0.00 0 0
0.02/0.05 c twoopt : 0.00 0 0
0.02/0.05 c fixandinfer : 0.00 0 0
0.02/0.05 c feaspump : 0.00 0 0
0.02/0.05 c coefdiving : 0.00 0 0
0.02/0.05 c pscostdiving : 0.00 0 0
0.02/0.05 c fracdiving : 0.00 0 0
0.02/0.05 c veclendiving : 0.00 0 0
0.02/0.05 c intdiving : 0.00 0 0
0.02/0.05 c actconsdiving : 0.00 0 0
0.02/0.05 c objpscostdiving : 0.00 0 0
0.02/0.05 c rootsoldiving : 0.00 0 0
0.02/0.05 c linesearchdiving : 0.00 0 0
0.02/0.05 c guideddiving : 0.00 0 0
0.02/0.06 c octane : 0.00 0 0
0.02/0.06 c rens : 0.00 0 0
0.02/0.06 c rins : 0.00 0 0
0.02/0.06 c localbranching : 0.00 0 0
0.02/0.06 c mutation : 0.00 0 0
0.02/0.06 c crossover : 0.00 0 0
0.02/0.06 c dins : 0.00 0 0
0.02/0.06 c undercover : 0.00 0 0
0.02/0.06 c nlp : 0.00 0 0
0.02/0.06 c trysol : 0.00 0 0
0.02/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.02/0.06 c primal LP : 0.00 0 0 0.00 -
0.02/0.06 c dual LP : 0.00 0 0 0.00 -
0.02/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.02/0.06 c barrier LP : 0.00 0 0 0.00 -
0.02/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.02/0.06 c strong branching : 0.00 0 0 0.00 -
0.02/0.06 c (at root node) : - 0 0 0.00 -
0.02/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.02/0.06 c B&B Tree :
0.02/0.06 c number of runs : 1
0.02/0.06 c nodes : 144
0.02/0.06 c nodes (total) : 144
0.02/0.06 c nodes left : 0
0.02/0.06 c max depth : 15
0.02/0.06 c max depth (total): 15
0.02/0.06 c backtracks : 37 (25.7%)
0.02/0.06 c delayed cutoffs : 23
0.02/0.06 c repropagations : 61 (111 domain reductions, 9 cutoffs)
0.02/0.06 c avg switch length: 3.83
0.02/0.06 c switching time : 0.00
0.02/0.06 c Solution :
0.02/0.06 c Solutions found : 2 (2 improvements)
0.02/0.06 c First Solution : +5.00000000000000e+00 (in run 1, after 68 nodes, 0.02 seconds, depth 15, found by <relaxation>)
0.02/0.06 c Primal Bound : +3.00000000000000e+00 (in run 1, after 144 nodes, 0.03 seconds, depth 11, found by <relaxation>)
0.02/0.06 c Dual Bound : +3.00000000000000e+00
0.02/0.06 c Gap : 0.00 %
0.02/0.06 c Root Dual Bound : +1.00000000000000e+00
0.02/0.06 c Root Iterations : 0
0.02/0.06 c Time complete: 0.06.