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-2663619-1276648330.opb>
0.00/0.01 c original problem has 162 variables (162 bin, 0 int, 0 impl, 0 cont) and 115 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) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 16 chg coeffs, 0 upgd conss, 516 impls, 0 clqs
0.00/0.03 c (round 2) 15 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 4 upgd conss, 756 impls, 0 clqs
0.02/0.03 c (round 3) 27 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 4 upgd conss, 876 impls, 0 clqs
0.02/0.03 c (round 4) 39 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 4 upgd conss, 876 impls, 0 clqs
0.02/0.04 c presolving (5 rounds):
0.02/0.04 c 39 deleted vars, 30 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 46 changed coefficients
0.02/0.04 c 894 implications, 0 cliques
0.02/0.04 c presolved problem has 123 variables (123 bin, 0 int, 0 impl, 0 cont) and 82 constraints
0.02/0.04 c 75 constraints of type <and>
0.02/0.04 c 3 constraints of type <linear>
0.02/0.04 c 4 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 2)
0.02/0.04 c Presolving Time: 0.02
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 1.2.1.2
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1799.99
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 1620
0.02/0.04 c
0.02/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c lp/solvefreq = -1
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c heuristics/undercover/freq = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/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.02/0.04 c 0.0s| 1 | 2 | 0 | - | 499k| 0 | - | 123 | 82 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.19/0.29 o 33
0.19/0.29 c * 0.2s| 1462 | 839 | 0 | 0.0 |1226k| 26 | - | 123 | 469 | 0 | 0 | 0 | 422 | 0 | 1.000000e+00 | 3.300000e+01 |3200.00%
0.29/0.34 o 3
0.29/0.34 c * 0.3s| 1677 | 804 | 0 | 0.0 |1284k| 26 | - | 123 | 543 | 0 | 0 | 0 | 524 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.29/0.35 c
0.29/0.35 c SCIP Status : problem is solved [optimal solution found]
0.29/0.35 c Solving Time (sec) : 0.27
0.29/0.35 c Solving Nodes : 1677
0.29/0.35 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.29/0.35 c Dual Bound : +3.00000000000000e+00
0.29/0.35 c Gap : 0.00 %
0.29/0.35 s OPTIMUM FOUND
0.29/0.35 v -x54 -x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x36 x35 -x34 -x33 -x32 x31 -x42 -x41 -x40 -x39 x38 -x37 -x30 -x29 -x28
0.29/0.35 v -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 x1
0.29/0.35 c SCIP Status : problem is solved [optimal solution found]
0.29/0.35 c Solving Time : 0.27
0.29/0.35 c Original Problem :
0.29/0.35 c Problem name : HOME/instance-2663619-1276648330.opb
0.29/0.35 c Variables : 162 (162 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.35 c Constraints : 115 initial, 115 maximal
0.29/0.35 c Presolved Problem :
0.29/0.35 c Problem name : t_HOME/instance-2663619-1276648330.opb
0.29/0.35 c Variables : 123 (123 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.35 c Constraints : 82 initial, 544 maximal
0.29/0.35 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.35 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.35 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.35 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.35 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.35 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.35 c probing : 0.01 0 0 0 0 0 0 0 0
0.29/0.35 c and : 0.00 6 30 0 0 0 30 0 30
0.29/0.35 c linear : 0.01 1 2 0 0 0 0 0 16
0.29/0.35 c logicor : 0.00 0 0 0 0 0 0 0 0
0.29/0.35 c root node : - 36 - - 36 - - - -
0.29/0.35 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.35 c integral : 0 0 0 0 0 0 0 0 0 0
0.29/0.35 c and : 75 0 4249 0 1368 73 5278 0 0 0
0.29/0.35 c linear : 3 0 4175 0 1368 364 2883 0 0 0
0.29/0.35 c logicor : 4+ 0 1784 0 1366 22 594 0 0 0
0.29/0.35 c countsols : 0 0 0 0 1369 0 0 0 0 0
0.29/0.35 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.35 c integral : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c and : 0.04 0.00 0.04 0.00 0.00
0.29/0.35 c linear : 0.04 0.00 0.04 0.00 0.00
0.29/0.35 c logicor : 0.02 0.00 0.02 0.00 0.00
0.29/0.35 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c Propagators : Time Calls Cutoffs DomReds
0.29/0.35 c vbounds : 0.00 2 0 0
0.29/0.35 c rootredcost : 0.00 0 0 0
0.29/0.35 c pseudoobj : 0.01 3994 0 55
0.29/0.35 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.35 c propagation : 0.03 459 429 2987 26.2 78 28.0 -
0.29/0.35 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.35 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.35 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.35 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.35 c applied globally : - - - 505 13.4 - - -
0.29/0.35 c applied locally : - - - 20 35.0 - - -
0.29/0.35 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.35 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.29/0.35 c redcost : 0.00 0 0 0 0 0
0.29/0.35 c impliedbounds : 0.00 0 0 0 0 0
0.29/0.35 c intobj : 0.00 0 0 0 0 0
0.29/0.35 c cgmip : 0.00 0 0 0 0 0
0.29/0.35 c gomory : 0.00 0 0 0 0 0
0.29/0.35 c strongcg : 0.00 0 0 0 0 0
0.29/0.35 c cmir : 0.00 0 0 0 0 0
0.29/0.35 c flowcover : 0.00 0 0 0 0 0
0.29/0.35 c clique : 0.00 0 0 0 0 0
0.29/0.35 c zerohalf : 0.00 0 0 0 0 0
0.29/0.35 c mcf : 0.00 0 0 0 0 0
0.29/0.35 c rapidlearning : 0.00 0 0 0 0 0
0.29/0.35 c Pricers : Time Calls Vars
0.29/0.35 c problem variables: 0.00 0 0
0.29/0.35 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.35 c relpscost : 0.00 0 0 0 0 0 0
0.29/0.35 c pscost : 0.00 0 0 0 0 0 0
0.29/0.35 c inference : 0.03 1367 0 0 0 0 2734
0.29/0.35 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.35 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.35 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.35 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.35 c random : 0.00 0 0 0 0 0 0
0.29/0.35 c Primal Heuristics : Time Calls Found
0.29/0.35 c LP solutions : 0.00 - 0
0.29/0.35 c pseudo solutions : 0.01 - 2
0.29/0.35 c oneopt : 0.00 0 0
0.29/0.35 c trivial : 0.00 2 0
0.29/0.35 c simplerounding : 0.00 0 0
0.29/0.35 c zirounding : 0.00 0 0
0.29/0.35 c rounding : 0.00 0 0
0.29/0.35 c shifting : 0.00 0 0
0.29/0.35 c intshifting : 0.00 0 0
0.29/0.35 c twoopt : 0.00 0 0
0.29/0.35 c fixandinfer : 0.00 0 0
0.29/0.35 c feaspump : 0.00 0 0
0.29/0.35 c coefdiving : 0.00 0 0
0.29/0.35 c pscostdiving : 0.00 0 0
0.29/0.35 c fracdiving : 0.00 0 0
0.29/0.35 c veclendiving : 0.00 0 0
0.29/0.35 c intdiving : 0.00 0 0
0.29/0.35 c actconsdiving : 0.00 0 0
0.29/0.35 c objpscostdiving : 0.00 0 0
0.29/0.35 c rootsoldiving : 0.00 0 0
0.29/0.35 c linesearchdiving : 0.00 0 0
0.29/0.35 c guideddiving : 0.00 0 0
0.29/0.35 c octane : 0.00 0 0
0.29/0.35 c rens : 0.00 0 0
0.29/0.35 c rins : 0.00 0 0
0.29/0.35 c localbranching : 0.00 0 0
0.29/0.35 c mutation : 0.00 0 0
0.29/0.35 c crossover : 0.00 0 0
0.29/0.35 c dins : 0.00 0 0
0.29/0.35 c undercover : 0.00 0 0
0.29/0.35 c nlp : 0.00 0 0
0.29/0.35 c trysol : 0.00 0 0
0.29/0.35 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.35 c primal LP : 0.00 0 0 0.00 -
0.29/0.35 c dual LP : 0.00 0 0 0.00 -
0.29/0.35 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.35 c barrier LP : 0.00 0 0 0.00 -
0.29/0.35 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.35 c strong branching : 0.00 0 0 0.00 -
0.29/0.35 c (at root node) : - 0 0 0.00 -
0.29/0.35 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.35 c B&B Tree :
0.29/0.35 c number of runs : 1
0.29/0.35 c nodes : 1677
0.29/0.35 c nodes (total) : 1677
0.29/0.35 c nodes left : 0
0.29/0.35 c max depth : 26
0.29/0.35 c max depth (total): 26
0.29/0.35 c backtracks : 239 (14.3%)
0.29/0.35 c delayed cutoffs : 964
0.29/0.35 c repropagations : 395 (1573 domain reductions, 151 cutoffs)
0.29/0.35 c avg switch length: 4.03
0.29/0.35 c switching time : 0.03
0.29/0.35 c Solution :
0.29/0.35 c Solutions found : 2 (2 improvements)
0.29/0.35 c First Solution : +3.30000000000000e+01 (in run 1, after 1462 nodes, 0.22 seconds, depth 21, found by <relaxation>)
0.29/0.35 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1677 nodes, 0.26 seconds, depth 21, found by <relaxation>)
0.29/0.35 c Dual Bound : +3.00000000000000e+00
0.29/0.35 c Gap : 0.00 %
0.29/0.35 c Root Dual Bound : +1.00000000000000e+00
0.29/0.35 c Root Iterations : 0
0.29/0.35 c Time complete: 0.34.