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-2663664-1276649512.opb>
0.00/0.01 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 163 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.03 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 1012 impls, 0 clqs
0.00/0.03 c (round 2) 19 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 0 upgd conss, 1463 impls, 0 clqs
0.00/0.04 c (round 3) 30 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 7 upgd conss, 1783 impls, 0 clqs
0.00/0.04 c (round 4) 40 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 7 upgd conss, 2023 impls, 0 clqs
0.00/0.04 c (round 5) 50 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 7 upgd conss, 2183 impls, 0 clqs
0.00/0.05 c (round 6) 60 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 7 upgd conss, 2263 impls, 0 clqs
0.00/0.05 c (round 7) 70 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 7 upgd conss, 2263 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 144/170 (84.7%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (8 rounds):
0.00/0.07 c 70 deleted vars, 49 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 70 changed coefficients
0.00/0.07 c 2287 implications, 0 cliques
0.00/0.07 c presolved problem has 170 variables (170 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.00/0.07 c 94 constraints of type <and>
0.00/0.07 c 6 constraints of type <linear>
0.00/0.07 c 8 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 2)
0.00/0.07 c Presolving Time: 0.03
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = -1
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c heuristics/undercover/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.07 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.07 c 0.0s| 1 | 2 | 0 | - | 678k| 0 | - | 170 | 108 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.19/0.28 o 5
0.19/0.28 c * 0.2s| 1426 | 395 | 0 | 0.0 |1133k| 39 | - | 170 | 363 | 0 | 0 | 0 | 278 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
0.39/0.41 o 3
0.39/0.41 c * 0.3s| 2164 | 0 | 0 | 0.0 | 900k| 39 | - | 170 | 391 | 0 | 0 | 0 | 482 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.41 c
0.39/0.41 c SCIP Status : problem is solved [optimal solution found]
0.39/0.41 c Solving Time (sec) : 0.32
0.39/0.41 c Solving Nodes : 2164
0.39/0.41 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.39/0.41 c Dual Bound : +3.00000000000000e+00
0.39/0.41 c Gap : 0.00 %
0.39/0.41 s OPTIMUM FOUND
0.39/0.41 v -x90 -x89 -x88 x87 -x86 -x85 -x84 x83 -x82 x81 -x60 x59 x58 x57 x56 -x80 -x79 x78 -x77 -x76 -x55 -x54 x53 x52 x51 x75 -x74 -x73
0.39/0.41 v -x72 -x71 -x50 x49 x48 x47 x46 -x70 -x69 -x68 -x67 x66 x45 -x44 -x43 -x42 x41 -x65 -x64 -x63 -x62 x61 -x40 -x39 x38 x37 x36
0.39/0.41 v -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 x9 x8 -x7
0.39/0.41 v x6 -x5 -x4 -x3 x2 x1
0.39/0.41 c SCIP Status : problem is solved [optimal solution found]
0.39/0.41 c Solving Time : 0.32
0.39/0.41 c Original Problem :
0.39/0.41 c Problem name : HOME/instance-2663664-1276649512.opb
0.39/0.41 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.41 c Constraints : 163 initial, 163 maximal
0.39/0.41 c Presolved Problem :
0.39/0.41 c Problem name : t_HOME/instance-2663664-1276649512.opb
0.39/0.41 c Variables : 170 (170 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.41 c Constraints : 108 initial, 391 maximal
0.39/0.41 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.41 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.41 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.41 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.41 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.41 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.41 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.41 c and : 0.01 12 49 0 0 0 49 0 49
0.39/0.41 c linear : 0.01 2 7 0 0 0 0 0 21
0.39/0.41 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.41 c root node : - 19 - - 19 - - - -
0.39/0.41 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.41 c integral : 0 0 0 0 0 0 0 0 0 0
0.39/0.41 c and : 94 0 5702 0 1949 46 6707 0 0 0
0.39/0.41 c linear : 6 0 5654 0 1949 196 3154 0 0 0
0.39/0.41 c logicor : 8+ 0 2654 0 1949 32 840 0 0 0
0.39/0.41 c countsols : 0 0 0 0 1951 0 0 0 0 0
0.39/0.41 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.41 c integral : 0.00 0.00 0.00 0.00 0.00
0.39/0.41 c and : 0.03 0.00 0.02 0.00 0.01
0.39/0.41 c linear : 0.09 0.00 0.09 0.00 0.00
0.39/0.41 c logicor : 0.01 0.00 0.01 0.00 0.00
0.39/0.41 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.41 c Propagators : Time Calls Cutoffs DomReds
0.39/0.41 c vbounds : 0.00 2 0 0
0.39/0.41 c rootredcost : 0.01 0 0 0
0.39/0.41 c pseudoobj : 0.02 5405 0 12
0.39/0.41 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.41 c propagation : 0.01 274 273 1787 22.3 34 17.2 -
0.39/0.41 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.41 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.41 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.41 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.41 c applied globally : - - - 482 14.5 - - -
0.39/0.41 c applied locally : - - - 0 0.0 - - -
0.39/0.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.41 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.41 c redcost : 0.00 0 0 0 0 0
0.39/0.41 c impliedbounds : 0.00 0 0 0 0 0
0.39/0.41 c intobj : 0.00 0 0 0 0 0
0.39/0.41 c cgmip : 0.00 0 0 0 0 0
0.39/0.41 c gomory : 0.00 0 0 0 0 0
0.39/0.42 c strongcg : 0.00 0 0 0 0 0
0.39/0.42 c cmir : 0.00 0 0 0 0 0
0.39/0.42 c flowcover : 0.00 0 0 0 0 0
0.39/0.42 c clique : 0.00 0 0 0 0 0
0.39/0.42 c zerohalf : 0.00 0 0 0 0 0
0.39/0.42 c mcf : 0.00 0 0 0 0 0
0.39/0.42 c rapidlearning : 0.00 0 0 0 0 0
0.39/0.42 c Pricers : Time Calls Vars
0.39/0.42 c problem variables: 0.00 0 0
0.39/0.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.42 c relpscost : 0.00 0 0 0 0 0 0
0.39/0.42 c pscost : 0.00 0 0 0 0 0 0
0.39/0.42 c inference : 0.07 1949 0 0 0 0 3898
0.39/0.42 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.42 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.42 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.42 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.42 c random : 0.00 0 0 0 0 0 0
0.39/0.42 c Primal Heuristics : Time Calls Found
0.39/0.42 c LP solutions : 0.00 - 0
0.39/0.42 c pseudo solutions : 0.00 - 2
0.39/0.42 c oneopt : 0.00 0 0
0.39/0.42 c trivial : 0.00 2 0
0.39/0.42 c simplerounding : 0.00 0 0
0.39/0.42 c zirounding : 0.00 0 0
0.39/0.42 c rounding : 0.00 0 0
0.39/0.42 c shifting : 0.00 0 0
0.39/0.42 c intshifting : 0.00 0 0
0.39/0.42 c twoopt : 0.00 0 0
0.39/0.42 c fixandinfer : 0.00 0 0
0.39/0.42 c feaspump : 0.00 0 0
0.39/0.42 c coefdiving : 0.00 0 0
0.39/0.42 c pscostdiving : 0.00 0 0
0.39/0.42 c fracdiving : 0.00 0 0
0.39/0.42 c veclendiving : 0.00 0 0
0.39/0.42 c intdiving : 0.00 0 0
0.39/0.42 c actconsdiving : 0.00 0 0
0.39/0.42 c objpscostdiving : 0.00 0 0
0.39/0.42 c rootsoldiving : 0.00 0 0
0.39/0.42 c linesearchdiving : 0.00 0 0
0.39/0.42 c guideddiving : 0.00 0 0
0.39/0.42 c octane : 0.00 0 0
0.39/0.42 c rens : 0.00 0 0
0.39/0.42 c rins : 0.00 0 0
0.39/0.42 c localbranching : 0.00 0 0
0.39/0.42 c mutation : 0.00 0 0
0.39/0.42 c crossover : 0.00 0 0
0.39/0.42 c dins : 0.00 0 0
0.39/0.42 c undercover : 0.00 0 0
0.39/0.42 c nlp : 0.00 0 0
0.39/0.42 c trysol : 0.00 0 0
0.39/0.42 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.42 c primal LP : 0.00 0 0 0.00 -
0.39/0.42 c dual LP : 0.00 0 0 0.00 -
0.39/0.42 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.42 c barrier LP : 0.00 0 0 0.00 -
0.39/0.42 c diving/probing LP: 0.00 0 0 0.00 -
0.39/0.42 c strong branching : 0.00 0 0 0.00 -
0.39/0.42 c (at root node) : - 0 0 0.00 -
0.39/0.42 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.42 c B&B Tree :
0.39/0.42 c number of runs : 1
0.39/0.42 c nodes : 2164
0.39/0.42 c nodes (total) : 2164
0.39/0.42 c nodes left : 0
0.39/0.42 c max depth : 39
0.39/0.42 c max depth (total): 39
0.39/0.42 c backtracks : 259 (12.0%)
0.39/0.42 c delayed cutoffs : 133
0.39/0.42 c repropagations : 595 (1183 domain reductions, 61 cutoffs)
0.39/0.42 c avg switch length: 4.12
0.39/0.42 c switching time : 0.01
0.39/0.42 c Solution :
0.39/0.42 c Solutions found : 2 (2 improvements)
0.39/0.42 c First Solution : +5.00000000000000e+00 (in run 1, after 1426 nodes, 0.21 seconds, depth 39, found by <relaxation>)
0.39/0.42 c Primal Bound : +3.00000000000000e+00 (in run 1, after 2164 nodes, 0.32 seconds, depth 28, found by <relaxation>)
0.39/0.42 c Dual Bound : +3.00000000000000e+00
0.39/0.42 c Gap : 0.00 %
0.39/0.42 c Root Dual Bound : +1.00000000000000e+00
0.39/0.42 c Root Iterations : 0
0.39/0.42 c Time complete: 0.42.