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-2663728-1276650996.opb>
0.00/0.01 c original problem has 210 variables (210 bin, 0 int, 0 impl, 0 cont) and 154 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) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 0 upgd conss, 684 impls, 0 clqs
0.00/0.03 c (round 2) 17 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 4 upgd conss, 1020 impls, 0 clqs
0.00/0.03 c (round 3) 31 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 4 upgd conss, 1188 impls, 0 clqs
0.00/0.04 c (round 4) 45 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 4 upgd conss, 1188 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 132/165 (80.0%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (5 rounds):
0.00/0.05 c 45 deleted vars, 36 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 56 changed coefficients
0.00/0.05 c 1200 implications, 0 cliques
0.00/0.05 c presolved problem has 165 variables (165 bin, 0 int, 0 impl, 0 cont) and 115 constraints
0.00/0.05 c 108 constraints of type <and>
0.00/0.05 c 3 constraints of type <linear>
0.00/0.05 c 4 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c lp/solvefreq = -1
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c heuristics/undercover/freq = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.05 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.05 c 0.0s| 1 | 2 | 0 | - | 616k| 0 | - | 165 | 115 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.59/0.69 o 3
0.59/0.69 c * 0.6s| 3673 | 1736 | 0 | 0.0 |1956k| 50 | - | 165 | 528 | 0 | 0 | 0 | 691 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.69/0.70 c
0.69/0.70 c SCIP Status : problem is solved [optimal solution found]
0.69/0.70 c Solving Time (sec) : 0.61
0.69/0.70 c Solving Nodes : 3674
0.69/0.70 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.69/0.70 c Dual Bound : +3.00000000000000e+00
0.69/0.70 c Gap : 0.00 %
0.69/0.70 s OPTIMUM FOUND
0.69/0.70 v -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 x52 -x51 -x50 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x49 -x48 -x47 -x46 -x45
0.69/0.70 v -x44 -x43 -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.69/0.70 v -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.69/0.70 c SCIP Status : problem is solved [optimal solution found]
0.69/0.70 c Solving Time : 0.61
0.69/0.70 c Original Problem :
0.69/0.70 c Problem name : HOME/instance-2663728-1276650996.opb
0.69/0.70 c Variables : 210 (210 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 154 initial, 154 maximal
0.69/0.70 c Presolved Problem :
0.69/0.70 c Problem name : t_HOME/instance-2663728-1276650996.opb
0.69/0.70 c Variables : 165 (165 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 115 initial, 529 maximal
0.69/0.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.70 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c probing : 0.01 0 0 0 0 0 0 0 0
0.69/0.70 c and : 0.01 6 36 0 0 0 36 0 36
0.69/0.70 c linear : 0.00 1 2 0 0 0 0 0 20
0.69/0.70 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c root node : - 49 - - 49 - - - -
0.69/0.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.70 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.70 c and : 108 0 8797 0 3273 140 14280 0 0 0
0.69/0.70 c linear : 3 0 8657 0 3273 378 5812 0 0 0
0.69/0.70 c logicor : 4+ 0 3933 0 3265 53 851 0 0 0
0.69/0.70 c countsols : 0 0 0 0 3274 0 0 0 0 0
0.69/0.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.70 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c and : 0.08 0.00 0.06 0.00 0.02
0.69/0.70 c linear : 0.16 0.00 0.16 0.00 0.00
0.69/0.70 c logicor : 0.04 0.00 0.03 0.00 0.01
0.69/0.70 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c Propagators : Time Calls Cutoffs DomReds
0.69/0.70 c vbounds : 0.00 2 0 0
0.69/0.70 c rootredcost : 0.02 0 0 0
0.69/0.70 c pseudoobj : 0.00 8530 0 12
0.69/0.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.70 c propagation : 0.05 571 569 4098 34.2 29 33.6 -
0.69/0.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c applied globally : - - - 671 15.8 - - -
0.69/0.70 c applied locally : - - - 21 36.0 - - -
0.69/0.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.70 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.70 c redcost : 0.00 0 0 0 0 0
0.69/0.70 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.70 c intobj : 0.00 0 0 0 0 0
0.69/0.70 c cgmip : 0.00 0 0 0 0 0
0.69/0.70 c gomory : 0.00 0 0 0 0 0
0.69/0.70 c strongcg : 0.00 0 0 0 0 0
0.69/0.70 c cmir : 0.00 0 0 0 0 0
0.69/0.70 c flowcover : 0.00 0 0 0 0 0
0.69/0.70 c clique : 0.00 0 0 0 0 0
0.69/0.70 c zerohalf : 0.00 0 0 0 0 0
0.69/0.70 c mcf : 0.00 0 0 0 0 0
0.69/0.70 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.70 c Pricers : Time Calls Vars
0.69/0.70 c problem variables: 0.00 0 0
0.69/0.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.70 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.70 c pscost : 0.00 0 0 0 0 0 0
0.69/0.70 c inference : 0.07 3273 0 0 0 0 6546
0.69/0.70 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.70 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.70 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.70 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.70 c random : 0.00 0 0 0 0 0 0
0.69/0.70 c Primal Heuristics : Time Calls Found
0.69/0.70 c LP solutions : 0.00 - 0
0.69/0.70 c pseudo solutions : 0.00 - 1
0.69/0.70 c oneopt : 0.00 0 0
0.69/0.70 c trivial : 0.00 2 0
0.69/0.70 c simplerounding : 0.00 0 0
0.69/0.70 c zirounding : 0.00 0 0
0.69/0.70 c rounding : 0.00 0 0
0.69/0.70 c shifting : 0.00 0 0
0.69/0.70 c intshifting : 0.00 0 0
0.69/0.70 c twoopt : 0.00 0 0
0.69/0.70 c fixandinfer : 0.00 0 0
0.69/0.70 c feaspump : 0.00 0 0
0.69/0.70 c coefdiving : 0.00 0 0
0.69/0.70 c pscostdiving : 0.00 0 0
0.69/0.70 c fracdiving : 0.00 0 0
0.69/0.70 c veclendiving : 0.00 0 0
0.69/0.70 c intdiving : 0.00 0 0
0.69/0.70 c actconsdiving : 0.00 0 0
0.69/0.70 c objpscostdiving : 0.00 0 0
0.69/0.70 c rootsoldiving : 0.00 0 0
0.69/0.70 c linesearchdiving : 0.00 0 0
0.69/0.70 c guideddiving : 0.00 0 0
0.69/0.70 c octane : 0.00 0 0
0.69/0.70 c rens : 0.00 0 0
0.69/0.70 c rins : 0.00 0 0
0.69/0.70 c localbranching : 0.00 0 0
0.69/0.70 c mutation : 0.00 0 0
0.69/0.70 c crossover : 0.00 0 0
0.69/0.70 c dins : 0.00 0 0
0.69/0.70 c undercover : 0.00 0 0
0.69/0.70 c nlp : 0.01 0 0
0.69/0.70 c trysol : 0.00 0 0
0.69/0.70 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.70 c primal LP : 0.00 0 0 0.00 -
0.69/0.70 c dual LP : 0.00 0 0 0.00 -
0.69/0.70 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.70 c barrier LP : 0.00 0 0 0.00 -
0.69/0.70 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.70 c strong branching : 0.00 0 0 0.00 -
0.69/0.70 c (at root node) : - 0 0 0.00 -
0.69/0.70 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.70 c B&B Tree :
0.69/0.70 c number of runs : 1
0.69/0.70 c nodes : 3674
0.69/0.70 c nodes (total) : 3674
0.69/0.70 c nodes left : 0
0.69/0.70 c max depth : 50
0.69/0.70 c max depth (total): 50
0.69/0.70 c backtracks : 345 (9.4%)
0.69/0.70 c delayed cutoffs : 1915
0.69/0.70 c repropagations : 572 (2271 domain reductions, 171 cutoffs)
0.69/0.70 c avg switch length: 3.58
0.69/0.70 c switching time : 0.09
0.69/0.70 c Solution :
0.69/0.70 c Solutions found : 1 (1 improvements)
0.69/0.70 c First Solution : +3.00000000000000e+00 (in run 1, after 3673 nodes, 0.60 seconds, depth 42, found by <relaxation>)
0.69/0.70 c Primal Bound : +3.00000000000000e+00 (in run 1, after 3673 nodes, 0.60 seconds, depth 42, found by <relaxation>)
0.69/0.70 c Dual Bound : +3.00000000000000e+00
0.69/0.70 c Gap : 0.00 %
0.69/0.70 c Root Dual Bound : +1.00000000000000e+00
0.69/0.70 c Root Iterations : 0
0.69/0.71 c Time complete: 0.71.