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-2663549-1276647095.opb>
0.00/0.01 c original problem has 216 variables (216 bin, 0 int, 0 impl, 0 cont) and 167 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) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 688 impls, 0 clqs
0.00/0.03 c (round 2) 20 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 3 upgd conss, 976 impls, 0 clqs
0.00/0.04 c (round 3) 38 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 53 chg coeffs, 3 upgd conss, 976 impls, 0 clqs
0.04/0.05 c (0.0s) probing: 128/178 (71.9%) - 0 fixings, 0 aggregations, 4 implications, 0 bound changes
0.04/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.04/0.05 c presolving (4 rounds):
0.04/0.05 c 38 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 53 changed coefficients
0.04/0.05 c 984 implications, 0 cliques
0.04/0.05 c presolved problem has 178 variables (178 bin, 0 int, 0 impl, 0 cont) and 133 constraints
0.04/0.05 c 128 constraints of type <and>
0.04/0.05 c 2 constraints of type <linear>
0.04/0.05 c 3 constraints of type <logicor>
0.04/0.05 c transformed objective value is always integral (scale: 2)
0.04/0.05 c Presolving Time: 0.03
0.04/0.05 c - non default parameters ----------------------------------------------------------------------
0.04/0.05 c # SCIP version 1.2.1.2
0.04/0.05 c
0.04/0.05 c # frequency for displaying node information lines
0.04/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.05 c display/freq = 10000
0.04/0.05 c
0.04/0.05 c # maximal time in seconds to run
0.04/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.05 c limits/time = 1800
0.04/0.05 c
0.04/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.05 c limits/memory = 1620
0.04/0.05 c
0.04/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.04/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.05 c lp/solvefreq = -1
0.04/0.05 c
0.04/0.05 c # should presolving try to simplify inequalities
0.04/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.05 c constraints/linear/simplifyinequalities = TRUE
0.04/0.05 c
0.04/0.05 c # should presolving try to simplify knapsacks
0.04/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.05 c
0.04/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.05 c heuristics/undercover/freq = 0
0.04/0.05 c
0.04/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.05 c separating/rapidlearning/freq = 0
0.04/0.05 c
0.04/0.05 c -----------------------------------------------------------------------------------------------
0.04/0.05 c start solving
0.04/0.05 c
0.04/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.04/0.05 c 0.0s| 1 | 2 | 0 | - | 634k| 0 | - | 178 | 133 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.19/1.26 o 5
1.19/1.26 c * 1.1s| 8253 | 3073 | 0 | 0.0 |2860k| 66 | - | 178 | 307 | 0 | 0 | 0 | 280 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.49/1.59 c 1.4s| 10000 | 3299 | 0 | 0.0 |3977k| 66 | - | 178 | 343 | 0 | 0 | 0 | 336 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.89/1.90 o 3
1.89/1.90 c * 1.7s| 11712 | 2243 | 0 | 0.0 |2523k| 66 | - | 178 | 377 | 0 | 0 | 0 | 393 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.89/1.91 c
1.89/1.91 c SCIP Status : problem is solved [optimal solution found]
1.89/1.91 c Solving Time (sec) : 1.67
1.89/1.91 c Solving Nodes : 11713
1.89/1.91 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.89/1.91 c Dual Bound : +3.00000000000000e+00
1.89/1.91 c Gap : 0.00 %
1.89/1.91 s OPTIMUM FOUND
1.89/1.91 v -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 x37 -x36 x35 -x34 -x33 x32 -x31 -x30 -x29
1.89/1.91 v x28 -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
1.89/1.91 c SCIP Status : problem is solved [optimal solution found]
1.89/1.91 c Solving Time : 1.67
1.89/1.91 c Original Problem :
1.89/1.91 c Problem name : HOME/instance-2663549-1276647095.opb
1.89/1.91 c Variables : 216 (216 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.91 c Constraints : 167 initial, 167 maximal
1.89/1.91 c Presolved Problem :
1.89/1.91 c Problem name : t_HOME/instance-2663549-1276647095.opb
1.89/1.91 c Variables : 178 (178 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.91 c Constraints : 133 initial, 378 maximal
1.89/1.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.91 c trivial : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c probing : 0.01 0 0 0 0 0 0 0 0
1.89/1.91 c and : 0.01 4 32 0 0 0 32 0 32
1.89/1.91 c linear : 0.00 1 1 0 0 0 0 0 21
1.89/1.91 c logicor : 0.01 0 0 0 0 0 0 0 0
1.89/1.91 c root node : - 81 - - 81 - - - -
1.89/1.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.91 c integral : 0 0 0 0 0 0 0 0 0 0
1.89/1.91 c and : 128 0 20854 0 7713 242 76877 0 0 0
1.89/1.91 c linear : 2 0 20610 0 7713 3799 26086 0 0 0
1.89/1.91 c logicor : 3+ 0 5076 0 7711 20 958 0 0 0
1.89/1.91 c countsols : 0 0 0 0 7715 0 0 0 0 0
1.89/1.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.91 c integral : 0.00 0.00 0.00 0.00 0.00
1.89/1.91 c and : 0.24 0.00 0.19 0.00 0.05
1.89/1.91 c linear : 0.44 0.00 0.43 0.00 0.01
1.89/1.91 c logicor : 0.06 0.00 0.04 0.00 0.02
1.89/1.91 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.91 c Propagators : Time Calls Cutoffs DomReds
1.89/1.91 c vbounds : 0.00 2 0 0
1.89/1.91 c rootredcost : 0.00 0 0 0
1.89/1.91 c pseudoobj : 0.04 20597 0 5679
1.89/1.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.91 c propagation : 0.07 461 319 2359 42.3 102 48.2 -
1.89/1.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.91 c applied globally : - - - 367 14.7 - - -
1.89/1.91 c applied locally : - - - 27 46.7 - - -
1.89/1.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.91 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.89/1.91 c redcost : 0.00 0 0 0 0 0
1.89/1.91 c impliedbounds : 0.00 0 0 0 0 0
1.89/1.91 c intobj : 0.00 0 0 0 0 0
1.89/1.91 c cgmip : 0.00 0 0 0 0 0
1.89/1.91 c gomory : 0.00 0 0 0 0 0
1.89/1.91 c strongcg : 0.00 0 0 0 0 0
1.89/1.91 c cmir : 0.00 0 0 0 0 0
1.89/1.91 c flowcover : 0.00 0 0 0 0 0
1.89/1.91 c clique : 0.00 0 0 0 0 0
1.89/1.91 c zerohalf : 0.00 0 0 0 0 0
1.89/1.91 c mcf : 0.00 0 0 0 0 0
1.89/1.91 c rapidlearning : 0.00 0 0 0 0 0
1.89/1.91 c Pricers : Time Calls Vars
1.89/1.91 c problem variables: 0.00 0 0
1.89/1.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.91 c relpscost : 0.00 0 0 0 0 0 0
1.89/1.91 c pscost : 0.00 0 0 0 0 0 0
1.89/1.91 c inference : 0.17 7713 0 0 0 0 15426
1.89/1.91 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.91 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.91 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.91 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.91 c random : 0.00 0 0 0 0 0 0
1.89/1.91 c Primal Heuristics : Time Calls Found
1.89/1.91 c LP solutions : 0.00 - 0
1.89/1.91 c pseudo solutions : 0.01 - 2
1.89/1.91 c oneopt : 0.01 0 0
1.89/1.91 c trivial : 0.00 2 0
1.89/1.91 c simplerounding : 0.00 0 0
1.89/1.91 c zirounding : 0.00 0 0
1.89/1.91 c rounding : 0.00 0 0
1.89/1.91 c shifting : 0.00 0 0
1.89/1.91 c intshifting : 0.00 0 0
1.89/1.91 c twoopt : 0.00 0 0
1.89/1.91 c fixandinfer : 0.00 0 0
1.89/1.91 c feaspump : 0.00 0 0
1.89/1.91 c coefdiving : 0.00 0 0
1.89/1.91 c pscostdiving : 0.00 0 0
1.89/1.91 c fracdiving : 0.00 0 0
1.89/1.91 c veclendiving : 0.00 0 0
1.89/1.91 c intdiving : 0.00 0 0
1.89/1.91 c actconsdiving : 0.00 0 0
1.89/1.91 c objpscostdiving : 0.00 0 0
1.89/1.91 c rootsoldiving : 0.00 0 0
1.89/1.91 c linesearchdiving : 0.00 0 0
1.89/1.91 c guideddiving : 0.00 0 0
1.89/1.91 c octane : 0.00 0 0
1.89/1.91 c rens : 0.00 0 0
1.89/1.91 c rins : 0.00 0 0
1.89/1.91 c localbranching : 0.00 0 0
1.89/1.91 c mutation : 0.00 0 0
1.89/1.91 c crossover : 0.00 0 0
1.89/1.91 c dins : 0.00 0 0
1.89/1.91 c undercover : 0.00 0 0
1.89/1.91 c nlp : 0.00 0 0
1.89/1.91 c trysol : 0.01 0 0
1.89/1.91 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.91 c primal LP : 0.00 0 0 0.00 -
1.89/1.91 c dual LP : 0.00 0 0 0.00 -
1.89/1.91 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.91 c barrier LP : 0.00 0 0 0.00 -
1.89/1.91 c diving/probing LP: 0.00 0 0 0.00 -
1.89/1.91 c strong branching : 0.00 0 0 0.00 -
1.89/1.91 c (at root node) : - 0 0 0.00 -
1.89/1.91 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.91 c B&B Tree :
1.89/1.91 c number of runs : 1
1.89/1.91 c nodes : 11713
1.89/1.91 c nodes (total) : 11713
1.89/1.91 c nodes left : 0
1.89/1.91 c max depth : 66
1.89/1.91 c max depth (total): 66
1.89/1.91 c backtracks : 1943 (16.6%)
1.89/1.91 c delayed cutoffs : 2310
1.89/1.91 c repropagations : 244 (1387 domain reductions, 63 cutoffs)
1.89/1.91 c avg switch length: 5.14
1.89/1.91 c switching time : 0.31
1.89/1.91 c Solution :
1.89/1.91 c Solutions found : 2 (2 improvements)
1.89/1.91 c First Solution : +5.00000000000000e+00 (in run 1, after 8253 nodes, 1.09 seconds, depth 35, found by <relaxation>)
1.89/1.91 c Primal Bound : +3.00000000000000e+00 (in run 1, after 11712 nodes, 1.65 seconds, depth 42, found by <relaxation>)
1.89/1.91 c Dual Bound : +3.00000000000000e+00
1.89/1.91 c Gap : 0.00 %
1.89/1.91 c Root Dual Bound : +1.00000000000000e+00
1.89/1.91 c Root Iterations : 0
1.89/1.92 c Time complete: 1.91.