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-2663623-1276648428.opb>
0.00/0.01 c original problem has 264 variables (264 bin, 0 int, 0 impl, 0 cont) and 199 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, 24 chg coeffs, 0 upgd conss, 876 impls, 0 clqs
0.00/0.04 c (round 2) 19 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 4 upgd conss, 1324 impls, 0 clqs
0.00/0.04 c (round 3) 35 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.00/0.05 c (round 4) 51 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 137/213 (64.3%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (5 rounds):
0.00/0.06 c 51 deleted vars, 42 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 66 changed coefficients
0.00/0.06 c 1560 implications, 0 cliques
0.00/0.06 c presolved problem has 213 variables (213 bin, 0 int, 0 impl, 0 cont) and 154 constraints
0.00/0.06 c 147 constraints of type <and>
0.00/0.06 c 3 constraints of type <linear>
0.00/0.06 c 4 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 2)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c lp/solvefreq = -1
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c heuristics/undercover/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 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.06 c 0.0s| 1 | 2 | 0 | - | 745k| 0 | - | 213 | 154 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.39/0.49 o 129
0.39/0.49 c * 0.4s| 2353 | 1499 | 0 | 0.0 |1925k| 96 | - | 213 | 364 | 0 | 0 | 0 | 356 | 0 | 1.000000e+00 | 1.290000e+02 | Large
1.20/1.20 o 33
1.20/1.20 c * 1.1s| 5468 | 2935 | 0 | 0.0 |3231k| 96 | - | 213 | 630 | 0 | 0 | 0 |1237 | 0 | 1.000000e+00 | 3.300000e+01 |3200.00%
2.30/2.34 c 2.1s| 10000 | 4740 | 0 | 0.0 |4969k| 96 | - | 213 | 755 | 0 | 0 | 0 |2427 | 0 | 1.000000e+00 | 3.300000e+01 |3200.00%
2.30/2.36 o 3
2.30/2.36 c * 2.1s| 10089 | 4584 | 0 | 0.0 |4928k| 96 | - | 213 | 773 | 0 | 0 | 0 |2449 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
2.30/2.38 c
2.30/2.38 c SCIP Status : problem is solved [optimal solution found]
2.30/2.38 c Solving Time (sec) : 2.11
2.30/2.38 c Solving Nodes : 10089
2.30/2.38 c Primal Bound : +3.00000000000000e+00 (3 solutions)
2.30/2.38 c Dual Bound : +3.00000000000000e+00
2.30/2.38 c Gap : 0.00 %
2.30/2.38 s OPTIMUM FOUND
2.30/2.38 v -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 -x64 x63 -x62 -x61 -x60 -x59 x58 -x57 -x48 -x47 -x46 -x45 -x44 -x43 x42 x41 -x56 -x55 -x54
2.30/2.38 v -x53 -x52 -x51 -x50 -x49 x40 -x39 -x38 -x37 -x36 -x35 -x34 x33 x32 -x31 -x30 -x29 x28 -x27 x26 x25 x24 -x23 -x22 -x21 -x20
2.30/2.38 v -x19 x18 x17 -x16 -x15 x14 -x13 x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
2.30/2.38 c SCIP Status : problem is solved [optimal solution found]
2.30/2.38 c Solving Time : 2.11
2.30/2.38 c Original Problem :
2.30/2.38 c Problem name : HOME/instance-2663623-1276648428.opb
2.30/2.38 c Variables : 264 (264 binary, 0 integer, 0 implicit integer, 0 continuous)
2.30/2.38 c Constraints : 199 initial, 199 maximal
2.30/2.38 c Presolved Problem :
2.30/2.38 c Problem name : t_HOME/instance-2663623-1276648428.opb
2.30/2.38 c Variables : 213 (213 binary, 0 integer, 0 implicit integer, 0 continuous)
2.30/2.38 c Constraints : 154 initial, 774 maximal
2.30/2.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.30/2.38 c trivial : 0.00 0 0 0 0 0 0 0 0
2.30/2.38 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.30/2.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.30/2.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.30/2.38 c implics : 0.00 0 0 0 0 0 0 0 0
2.30/2.38 c probing : 0.01 0 0 0 0 0 0 0 0
2.30/2.38 c and : 0.02 6 42 0 0 0 42 0 42
2.30/2.38 c linear : 0.00 1 2 0 0 0 0 0 24
2.30/2.38 c logicor : 0.00 0 0 0 0 0 0 0 0
2.30/2.38 c root node : - 64 - - 64 - - - -
2.30/2.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.30/2.38 c integral : 0 0 0 0 0 0 0 0 0 0
2.30/2.38 c and : 147 0 24827 0 8044 547 39689 0 0 0
2.30/2.38 c linear : 3 0 24277 0 8044 2262 19526 0 0 0
2.30/2.38 c logicor : 4+ 0 9461 0 8038 97 2699 0 0 0
2.30/2.38 c countsols : 0 0 0 0 8047 0 0 0 0 0
2.30/2.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.30/2.38 c integral : 0.00 0.00 0.00 0.00 0.00
2.30/2.38 c and : 0.29 0.00 0.26 0.00 0.03
2.30/2.38 c linear : 0.75 0.00 0.74 0.00 0.01
2.30/2.38 c logicor : 0.13 0.00 0.12 0.00 0.01
2.30/2.38 c countsols : 0.00 0.00 0.00 0.00 0.00
2.30/2.38 c Propagators : Time Calls Cutoffs DomReds
2.30/2.38 c vbounds : 0.01 2 0 0
2.30/2.38 c rootredcost : 0.01 0 0 0
2.30/2.38 c pseudoobj : 0.05 24555 6 381
2.30/2.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.30/2.38 c propagation : 0.35 2550 2228 20617 47.4 71 41.6 -
2.30/2.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.30/2.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.30/2.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.30/2.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.30/2.38 c applied globally : - - - 1749 17.3 - - -
2.30/2.38 c applied locally : - - - 701 46.2 - - -
2.30/2.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.30/2.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.30/2.38 c redcost : 0.00 0 0 0 0 0
2.30/2.38 c impliedbounds : 0.00 0 0 0 0 0
2.30/2.38 c intobj : 0.00 0 0 0 0 0
2.30/2.38 c cgmip : 0.00 0 0 0 0 0
2.30/2.38 c gomory : 0.00 0 0 0 0 0
2.30/2.38 c strongcg : 0.00 0 0 0 0 0
2.30/2.38 c cmir : 0.00 0 0 0 0 0
2.30/2.38 c flowcover : 0.00 0 0 0 0 0
2.30/2.38 c clique : 0.00 0 0 0 0 0
2.30/2.38 c zerohalf : 0.00 0 0 0 0 0
2.30/2.38 c mcf : 0.00 0 0 0 0 0
2.30/2.38 c rapidlearning : 0.00 0 0 0 0 0
2.30/2.38 c Pricers : Time Calls Vars
2.30/2.38 c problem variables: 0.00 0 0
2.30/2.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.30/2.38 c relpscost : 0.00 0 0 0 0 0 0
2.30/2.38 c pscost : 0.00 0 0 0 0 0 0
2.30/2.38 c inference : 0.21 8044 0 0 0 0 16088
2.30/2.38 c mostinf : 0.00 0 0 0 0 0 0
2.30/2.38 c leastinf : 0.00 0 0 0 0 0 0
2.30/2.38 c fullstrong : 0.00 0 0 0 0 0 0
2.30/2.38 c allfullstrong : 0.00 0 0 0 0 0 0
2.30/2.38 c random : 0.00 0 0 0 0 0 0
2.30/2.38 c Primal Heuristics : Time Calls Found
2.30/2.38 c LP solutions : 0.00 - 0
2.30/2.38 c pseudo solutions : 0.00 - 3
2.30/2.38 c oneopt : 0.00 0 0
2.30/2.38 c trivial : 0.00 2 0
2.30/2.38 c simplerounding : 0.00 0 0
2.30/2.38 c zirounding : 0.00 0 0
2.30/2.38 c rounding : 0.00 0 0
2.30/2.38 c shifting : 0.00 0 0
2.30/2.38 c intshifting : 0.00 0 0
2.30/2.38 c twoopt : 0.00 0 0
2.30/2.38 c fixandinfer : 0.00 0 0
2.30/2.38 c feaspump : 0.00 0 0
2.30/2.38 c coefdiving : 0.00 0 0
2.30/2.38 c pscostdiving : 0.00 0 0
2.30/2.38 c fracdiving : 0.00 0 0
2.30/2.38 c veclendiving : 0.00 0 0
2.30/2.38 c intdiving : 0.00 0 0
2.30/2.38 c actconsdiving : 0.00 0 0
2.30/2.38 c objpscostdiving : 0.00 0 0
2.30/2.38 c rootsoldiving : 0.00 0 0
2.30/2.38 c linesearchdiving : 0.00 0 0
2.30/2.38 c guideddiving : 0.00 0 0
2.30/2.38 c octane : 0.00 0 0
2.30/2.38 c rens : 0.00 0 0
2.30/2.38 c rins : 0.00 0 0
2.30/2.38 c localbranching : 0.00 0 0
2.30/2.38 c mutation : 0.00 0 0
2.30/2.38 c crossover : 0.00 0 0
2.30/2.38 c dins : 0.00 0 0
2.30/2.38 c undercover : 0.00 0 0
2.30/2.38 c nlp : 0.01 0 0
2.30/2.38 c trysol : 0.02 0 0
2.30/2.38 c LP : Time Calls Iterations Iter/call Iter/sec
2.30/2.38 c primal LP : 0.00 0 0 0.00 -
2.30/2.38 c dual LP : 0.00 0 0 0.00 -
2.30/2.38 c lex dual LP : 0.00 0 0 0.00 -
2.30/2.38 c barrier LP : 0.00 0 0 0.00 -
2.30/2.38 c diving/probing LP: 0.00 0 0 0.00 -
2.30/2.38 c strong branching : 0.00 0 0 0.00 -
2.30/2.38 c (at root node) : - 0 0 0.00 -
2.30/2.38 c conflict analysis: 0.00 0 0 0.00 -
2.30/2.38 c B&B Tree :
2.30/2.38 c number of runs : 1
2.30/2.38 c nodes : 10089
2.30/2.38 c nodes (total) : 10089
2.30/2.38 c nodes left : 0
2.30/2.38 c max depth : 96
2.30/2.38 c max depth (total): 96
2.30/2.38 c backtracks : 1338 (13.3%)
2.30/2.38 c delayed cutoffs : 5691
2.30/2.38 c repropagations : 2874 (9686 domain reductions, 870 cutoffs)
2.30/2.38 c avg switch length: 4.91
2.30/2.38 c switching time : 0.30
2.30/2.38 c Solution :
2.30/2.38 c Solutions found : 3 (3 improvements)
2.30/2.38 c First Solution : +1.29000000000000e+02 (in run 1, after 2353 nodes, 0.41 seconds, depth 41, found by <relaxation>)
2.30/2.38 c Primal Bound : +3.00000000000000e+00 (in run 1, after 10089 nodes, 2.09 seconds, depth 33, found by <relaxation>)
2.30/2.38 c Dual Bound : +3.00000000000000e+00
2.30/2.38 c Gap : 0.00 %
2.30/2.38 c Root Dual Bound : +1.00000000000000e+00
2.30/2.38 c Root Iterations : 0
2.30/2.39 c Time complete: 2.38.