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-2663529-1276646322.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.03/0.05 c (0.0s) probing: 128/178 (71.9%) - 0 fixings, 0 aggregations, 4 implications, 0 bound changes
0.03/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.05 c presolving (4 rounds):
0.03/0.05 c 38 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 53 changed coefficients
0.03/0.05 c 984 implications, 0 cliques
0.03/0.05 c presolved problem has 178 variables (178 bin, 0 int, 0 impl, 0 cont) and 133 constraints
0.03/0.05 c 128 constraints of type <and>
0.03/0.05 c 2 constraints of type <linear>
0.03/0.05 c 3 constraints of type <logicor>
0.03/0.05 c transformed objective value is always integral (scale: 2)
0.03/0.05 c Presolving Time: 0.03
0.03/0.05 c - non default parameters ----------------------------------------------------------------------
0.03/0.05 c # SCIP version 1.2.1.2
0.03/0.05 c
0.03/0.05 c # frequency for displaying node information lines
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.05 c display/freq = 10000
0.03/0.05 c
0.03/0.05 c # maximal time in seconds to run
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/time = 1800
0.03/0.05 c
0.03/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/memory = 1620
0.03/0.05 c
0.03/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c lp/solvefreq = -1
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify inequalities
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/linear/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify knapsacks
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c heuristics/undercover/freq = 0
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/rapidlearning/freq = 0
0.03/0.05 c
0.03/0.05 c -----------------------------------------------------------------------------------------------
0.03/0.05 c start solving
0.03/0.05 c
0.03/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.03/0.05 c 0.0s| 1 | 2 | 0 | - | 634k| 0 | - | 178 | 133 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.49/0.53 o 25
0.49/0.53 c * 0.4s| 3452 | 1548 | 0 | 0.0 |1668k| 63 | - | 178 | 209 | 0 | 0 | 0 | 103 | 0 | 1.000000e+00 | 2.500000e+01 |2400.00%
1.39/1.45 o 5
1.39/1.45 c * 1.2s| 8918 | 2831 | 0 | 0.0 |2829k| 63 | - | 178 | 301 | 0 | 0 | 0 | 398 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.39/1.49 o 3
1.39/1.49 c * 1.3s| 9122 | 2741 | 0 | 0.0 |2831k| 63 | - | 178 | 305 | 0 | 0 | 0 | 402 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.49/1.50 c
1.49/1.50 c SCIP Status : problem is solved [optimal solution found]
1.49/1.50 c Solving Time (sec) : 1.27
1.49/1.50 c Solving Nodes : 9122
1.49/1.50 c Primal Bound : +3.00000000000000e+00 (3 solutions)
1.49/1.50 c Dual Bound : +3.00000000000000e+00
1.49/1.50 c Gap : 0.00 %
1.49/1.50 s OPTIMUM FOUND
1.49/1.50 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.49/1.50 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.49/1.50 c SCIP Status : problem is solved [optimal solution found]
1.49/1.50 c Solving Time : 1.27
1.49/1.50 c Original Problem :
1.49/1.50 c Problem name : HOME/instance-2663529-1276646322.opb
1.49/1.50 c Variables : 216 (216 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.50 c Constraints : 167 initial, 167 maximal
1.49/1.50 c Presolved Problem :
1.49/1.50 c Problem name : t_HOME/instance-2663529-1276646322.opb
1.49/1.50 c Variables : 178 (178 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.50 c Constraints : 133 initial, 306 maximal
1.49/1.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.50 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c probing : 0.01 0 0 0 0 0 0 0 0
1.49/1.50 c and : 0.01 4 32 0 0 0 32 0 32
1.49/1.50 c linear : 0.00 1 1 0 0 0 0 0 21
1.49/1.50 c logicor : 0.01 0 0 0 0 0 0 0 0
1.49/1.50 c root node : - 81 - - 81 - - - -
1.49/1.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.50 c integral : 0 0 0 0 0 0 0 0 0 0
1.49/1.50 c and : 128 0 17878 0 6154 316 27407 0 0 0
1.49/1.50 c linear : 2 0 17559 0 6154 2722 17243 0 0 0
1.49/1.50 c logicor : 3+ 0 5046 0 6153 8 335 0 0 0
1.49/1.50 c countsols : 0 0 0 0 6157 0 0 0 0 0
1.49/1.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.50 c integral : 0.00 0.00 0.00 0.00 0.00
1.49/1.50 c and : 0.14 0.00 0.13 0.00 0.01
1.49/1.50 c linear : 0.46 0.00 0.45 0.00 0.01
1.49/1.50 c logicor : 0.04 0.00 0.03 0.00 0.01
1.49/1.50 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.50 c Propagators : Time Calls Cutoffs DomReds
1.49/1.50 c vbounds : 0.00 2 0 0
1.49/1.50 c rootredcost : 0.02 0 0 0
1.49/1.50 c pseudoobj : 0.01 17621 1 204
1.49/1.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.50 c propagation : 0.05 579 343 2369 40.1 103 48.1 -
1.49/1.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.50 c applied globally : - - - 358 14.4 - - -
1.49/1.50 c applied locally : - - - 45 46.9 - - -
1.49/1.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.49/1.50 c redcost : 0.00 0 0 0 0 0
1.49/1.50 c impliedbounds : 0.00 0 0 0 0 0
1.49/1.50 c intobj : 0.00 0 0 0 0 0
1.49/1.50 c cgmip : 0.00 0 0 0 0 0
1.49/1.50 c gomory : 0.00 0 0 0 0 0
1.49/1.50 c strongcg : 0.00 0 0 0 0 0
1.49/1.50 c cmir : 0.00 0 0 0 0 0
1.49/1.50 c flowcover : 0.00 0 0 0 0 0
1.49/1.50 c clique : 0.00 0 0 0 0 0
1.49/1.50 c zerohalf : 0.00 0 0 0 0 0
1.49/1.50 c mcf : 0.00 0 0 0 0 0
1.49/1.50 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.50 c Pricers : Time Calls Vars
1.49/1.50 c problem variables: 0.00 0 0
1.49/1.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.50 c relpscost : 0.00 0 0 0 0 0 0
1.49/1.50 c pscost : 0.00 0 0 0 0 0 0
1.49/1.50 c inference : 0.14 6154 0 0 0 0 12308
1.49/1.50 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.50 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.50 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.50 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.50 c random : 0.00 0 0 0 0 0 0
1.49/1.50 c Primal Heuristics : Time Calls Found
1.49/1.50 c LP solutions : 0.00 - 0
1.49/1.50 c pseudo solutions : 0.00 - 3
1.49/1.50 c oneopt : 0.01 0 0
1.49/1.50 c trivial : 0.00 2 0
1.49/1.50 c simplerounding : 0.00 0 0
1.49/1.50 c zirounding : 0.00 0 0
1.49/1.50 c rounding : 0.00 0 0
1.49/1.50 c shifting : 0.00 0 0
1.49/1.50 c intshifting : 0.00 0 0
1.49/1.50 c twoopt : 0.00 0 0
1.49/1.50 c fixandinfer : 0.00 0 0
1.49/1.50 c feaspump : 0.00 0 0
1.49/1.50 c coefdiving : 0.00 0 0
1.49/1.50 c pscostdiving : 0.00 0 0
1.49/1.50 c fracdiving : 0.00 0 0
1.49/1.50 c veclendiving : 0.00 0 0
1.49/1.50 c intdiving : 0.00 0 0
1.49/1.50 c actconsdiving : 0.00 0 0
1.49/1.50 c objpscostdiving : 0.00 0 0
1.49/1.50 c rootsoldiving : 0.00 0 0
1.49/1.50 c linesearchdiving : 0.00 0 0
1.49/1.50 c guideddiving : 0.00 0 0
1.49/1.50 c octane : 0.00 0 0
1.49/1.50 c rens : 0.00 0 0
1.49/1.50 c rins : 0.00 0 0
1.49/1.50 c localbranching : 0.00 0 0
1.49/1.50 c mutation : 0.00 0 0
1.49/1.50 c crossover : 0.00 0 0
1.49/1.50 c dins : 0.00 0 0
1.49/1.50 c undercover : 0.00 0 0
1.49/1.50 c nlp : 0.00 0 0
1.49/1.50 c trysol : 0.00 0 0
1.49/1.50 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.50 c primal LP : 0.00 0 0 0.00 -
1.49/1.50 c dual LP : 0.00 0 0 0.00 -
1.49/1.50 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.50 c barrier LP : 0.00 0 0 0.00 -
1.49/1.50 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.50 c strong branching : 0.00 0 0 0.00 -
1.49/1.50 c (at root node) : - 0 0 0.00 -
1.49/1.50 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.50 c B&B Tree :
1.49/1.50 c number of runs : 1
1.49/1.50 c nodes : 9122
1.49/1.50 c nodes (total) : 9122
1.49/1.50 c nodes left : 0
1.49/1.50 c max depth : 63
1.49/1.50 c max depth (total): 63
1.49/1.50 c backtracks : 1349 (14.8%)
1.49/1.50 c delayed cutoffs : 2908
1.49/1.50 c repropagations : 1374 (1811 domain reductions, 82 cutoffs)
1.49/1.50 c avg switch length: 4.67
1.49/1.50 c switching time : 0.16
1.49/1.50 c Solution :
1.49/1.50 c Solutions found : 3 (3 improvements)
1.49/1.50 c First Solution : +2.50000000000000e+01 (in run 1, after 3452 nodes, 0.44 seconds, depth 58, found by <relaxation>)
1.49/1.50 c Primal Bound : +3.00000000000000e+00 (in run 1, after 9122 nodes, 1.26 seconds, depth 31, found by <relaxation>)
1.49/1.50 c Dual Bound : +3.00000000000000e+00
1.49/1.50 c Gap : 0.00 %
1.49/1.50 c Root Dual Bound : +1.00000000000000e+00
1.49/1.50 c Root Iterations : 0
1.49/1.51 c Time complete: 1.5.