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-2663615-1276648293.opb>
0.00/0.01 c original problem has 120 variables (120 bin, 0 int, 0 impl, 0 cont) and 82 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) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 376 impls, 0 clqs
0.00/0.02 c (round 2) 16 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 566 impls, 0 clqs
0.00/0.02 c (round 3) 27 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 4 upgd conss, 646 impls, 0 clqs
0.00/0.03 c (round 4) 37 del vars, 26 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 4 upgd conss, 646 impls, 0 clqs
0.00/0.03 c (round 5) 38 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 4 upgd conss, 646 impls, 0 clqs
0.00/0.04 c presolving (6 rounds):
0.00/0.04 c 38 deleted vars, 27 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 38 changed coefficients
0.00/0.04 c 664 implications, 0 cliques
0.00/0.04 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 52 constraints
0.00/0.04 c 45 constraints of type <and>
0.00/0.04 c 3 constraints of type <linear>
0.00/0.04 c 4 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 2)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1800
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = -1
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 2 | 0 | - | 387k| 0 | - | 82 | 52 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.00/0.05 o 7
0.00/0.05 c * 0.0s| 83 | 50 | 0 | 0.0 | 431k| 17 | - | 82 | 71 | 0 | 0 | 0 | 19 | 0 | 1.000000e+00 | 7.000000e+00 | 600.00%
0.00/0.05 o 5
0.00/0.05 c * 0.0s| 91 | 52 | 0 | 0.0 | 437k| 17 | - | 82 | 73 | 0 | 0 | 0 | 21 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
0.00/0.06 o 3
0.00/0.06 c * 0.0s| 141 | 25 | 0 | 0.0 | 445k| 17 | - | 82 | 82 | 0 | 0 | 0 | 30 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.04
0.00/0.06 c Solving Nodes : 142
0.00/0.06 c Primal Bound : +3.00000000000000e+00 (3 solutions)
0.00/0.06 c Dual Bound : +3.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x30 -x29 x28 -x27 x26 -x35 -x34 -x33 -x32 x31 -x25 -x24 -x23 -x22 x21 x20 x19
0.00/0.06 v x18 -x17 x16 -x15 -x14 x13 -x12 x11 -x10 x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time : 0.04
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-2663615-1276648293.opb
0.00/0.06 c Variables : 120 (120 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 82 initial, 82 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-2663615-1276648293.opb
0.00/0.06 c Variables : 82 (82 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 52 initial, 85 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c and : 0.00 6 27 0 0 0 27 0 26
0.00/0.06 c linear : 0.00 1 4 0 0 0 0 0 12
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 25 - - 25 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c and : 45 0 516 0 120 4 578 0 0 0
0.00/0.06 c linear : 3 0 510 0 120 16 273 0 0 0
0.00/0.06 c logicor : 4+ 0 168 0 121 5 63 0 0 0
0.00/0.06 c countsols : 0 0 0 0 123 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c and : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c vbounds : 0.00 2 0 0
0.00/0.06 c rootredcost : 0.00 0 0 0
0.00/0.06 c pseudoobj : 0.00 349 1 76
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 26 25 120 16.1 0 0.0 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 33 9.5 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 0 0 0 0 0
0.00/0.06 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 0 0 0 0 0
0.00/0.06 c strongcg : 0.00 0 0 0 0 0
0.00/0.06 c cmir : 0.00 0 0 0 0 0
0.00/0.06 c flowcover : 0.00 0 0 0 0 0
0.00/0.06 c clique : 0.00 0 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 0 0 0 0 0
0.00/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 120 0 0 0 0 240
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 0
0.00/0.06 c pseudo solutions : 0.00 - 3
0.00/0.06 c oneopt : 0.00 0 0
0.00/0.06 c trivial : 0.00 2 0
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 0 0
0.00/0.06 c shifting : 0.00 0 0
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c undercover : 0.00 0 0
0.00/0.06 c nlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.00 0 0 0.00 -
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 142
0.00/0.06 c nodes (total) : 142
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 17
0.00/0.06 c max depth (total): 17
0.00/0.06 c backtracks : 42 (29.6%)
0.00/0.06 c delayed cutoffs : 28
0.00/0.06 c repropagations : 47 (174 domain reductions, 7 cutoffs)
0.00/0.06 c avg switch length: 4.38
0.00/0.06 c switching time : 0.02
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 3 (3 improvements)
0.00/0.06 c First Solution : +7.00000000000000e+00 (in run 1, after 83 nodes, 0.03 seconds, depth 15, found by <relaxation>)
0.00/0.06 c Primal Bound : +3.00000000000000e+00 (in run 1, after 141 nodes, 0.04 seconds, depth 13, found by <relaxation>)
0.00/0.06 c Dual Bound : +3.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +1.00000000000000e+00
0.00/0.06 c Root Iterations : 0
0.00/0.07 c Time complete: 0.06.