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-2663509-1276645940.opb>
0.00/0.01 c original problem has 350 variables (350 bin, 0 int, 0 impl, 0 cont) and 256 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.04 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1300 impls, 0 clqs
0.00/0.05 c (round 2) 19 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 6 upgd conss, 1972 impls, 0 clqs
0.00/0.05 c (round 3) 33 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 6 upgd conss, 2476 impls, 0 clqs
0.00/0.05 c (round 4) 47 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 6 upgd conss, 2812 impls, 0 clqs
0.00/0.06 c (round 5) 61 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 78 chg coeffs, 6 upgd conss, 2980 impls, 0 clqs
0.00/0.06 c (round 6) 75 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 90 chg coeffs, 6 upgd conss, 2980 impls, 0 clqs
0.00/0.08 c (0.0s) probing: 156/275 (56.7%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.00/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.08 c presolving (7 rounds):
0.00/0.08 c 75 deleted vars, 60 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 90 changed coefficients
0.00/0.08 c 3000 implications, 0 cliques
0.00/0.08 c presolved problem has 275 variables (275 bin, 0 int, 0 impl, 0 cont) and 191 constraints
0.00/0.08 c 180 constraints of type <and>
0.00/0.08 c 5 constraints of type <linear>
0.00/0.08 c 6 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 2)
0.00/0.08 c Presolving Time: 0.05
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1800
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c lp/solvefreq = -1
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c heuristics/undercover/freq = 0
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/rapidlearning/freq = 0
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.08 c
0.00/0.08 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.08 c 0.1s| 1 | 2 | 0 | - | 955k| 0 | - | 275 | 191 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
2.09/2.13 c 1.9s| 10000 | 6658 | 0 | 0.0 |6153k| 137 | - | 275 |1030 | 0 | 0 | 0 |2250 | 0 | 1.000000e+00 | -- | Inf
3.30/3.37 o 3
3.30/3.37 c * 3.0s| 15015 | 8576 | 0 | 0.0 |7978k| 137 | - | 275 |1146 | 0 | 0 | 0 |3959 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
3.39/3.42 c
3.39/3.42 c SCIP Status : problem is solved [optimal solution found]
3.39/3.42 c Solving Time (sec) : 3.04
3.39/3.42 c Solving Nodes : 15016
3.39/3.42 c Primal Bound : +3.00000000000000e+00 (1 solutions)
3.39/3.42 c Dual Bound : +3.00000000000000e+00
3.39/3.42 c Gap : 0.00 %
3.39/3.42 s OPTIMUM FOUND
3.39/3.42 v -x105 -x104 -x103 -x102 -x101 x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x70 -x69 -x68 -x67 x66 x65 x64 -x91 -x90 -x89 -x88
3.39/3.42 v -x87 x86 x85 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x56 -x55 -x54 -x53 x52 -x51 x50 -x77 -x76
3.39/3.42 v -x75 -x74 -x73 -x72 x71 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 x41 x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 x31 x30 x29 x28
3.39/3.42 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
3.39/3.42 c SCIP Status : problem is solved [optimal solution found]
3.39/3.42 c Solving Time : 3.04
3.39/3.42 c Original Problem :
3.39/3.42 c Problem name : HOME/instance-2663509-1276645940.opb
3.39/3.42 c Variables : 350 (350 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.42 c Constraints : 256 initial, 256 maximal
3.39/3.42 c Presolved Problem :
3.39/3.42 c Problem name : t_HOME/instance-2663509-1276645940.opb
3.39/3.42 c Variables : 275 (275 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.42 c Constraints : 191 initial, 1280 maximal
3.39/3.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.39/3.42 c trivial : 0.00 0 0 0 0 0 0 0 0
3.39/3.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.39/3.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.39/3.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.39/3.42 c implics : 0.00 0 0 0 0 0 0 0 0
3.39/3.42 c probing : 0.01 0 0 0 0 0 0 0 0
3.39/3.42 c and : 0.03 10 60 0 0 0 60 0 60
3.39/3.42 c linear : 0.00 1 4 0 0 0 0 0 30
3.39/3.42 c logicor : 0.00 0 0 0 0 0 0 0 0
3.39/3.42 c root node : - 49 - - 49 - - - -
3.39/3.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.39/3.42 c integral : 0 0 0 0 0 0 0 0 0 0
3.39/3.42 c and : 180 0 37639 0 12744 516 55649 0 0 0
3.39/3.42 c linear : 5 0 37122 0 12744 2983 28543 0 0 0
3.39/3.42 c logicor : 6+ 0 15176 0 12745 149 4810 0 0 0
3.39/3.42 c countsols : 0 0 0 0 12745 0 0 0 0 0
3.39/3.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.39/3.42 c integral : 0.00 0.00 0.00 0.00 0.00
3.39/3.42 c and : 0.43 0.00 0.33 0.00 0.10
3.39/3.42 c linear : 0.98 0.00 0.98 0.00 0.00
3.39/3.42 c logicor : 0.15 0.00 0.13 0.00 0.02
3.39/3.42 c countsols : 0.01 0.00 0.00 0.00 0.01
3.39/3.42 c Propagators : Time Calls Cutoffs DomReds
3.39/3.42 c vbounds : 0.02 2 0 0
3.39/3.42 c rootredcost : 0.02 0 0 0
3.39/3.42 c pseudoobj : 0.03 37319 0 12
3.39/3.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.39/3.42 c propagation : 0.44 3648 3643 32369 45.8 238 42.7 -
3.39/3.42 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.39/3.42 c applied globally : - - - 2718 20.4 - - -
3.39/3.42 c applied locally : - - - 1242 41.4 - - -
3.39/3.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.39/3.42 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.39/3.42 c redcost : 0.00 0 0 0 0 0
3.39/3.42 c impliedbounds : 0.00 0 0 0 0 0
3.39/3.42 c intobj : 0.00 0 0 0 0 0
3.39/3.42 c cgmip : 0.00 0 0 0 0 0
3.39/3.42 c gomory : 0.00 0 0 0 0 0
3.39/3.42 c strongcg : 0.00 0 0 0 0 0
3.39/3.42 c cmir : 0.00 0 0 0 0 0
3.39/3.42 c flowcover : 0.00 0 0 0 0 0
3.39/3.42 c clique : 0.00 0 0 0 0 0
3.39/3.42 c zerohalf : 0.00 0 0 0 0 0
3.39/3.42 c mcf : 0.00 0 0 0 0 0
3.39/3.42 c rapidlearning : 0.00 0 0 0 0 0
3.39/3.42 c Pricers : Time Calls Vars
3.39/3.42 c problem variables: 0.00 0 0
3.39/3.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.39/3.42 c relpscost : 0.00 0 0 0 0 0 0
3.39/3.42 c pscost : 0.00 0 0 0 0 0 0
3.39/3.42 c inference : 0.33 12744 0 0 0 0 25488
3.39/3.42 c mostinf : 0.00 0 0 0 0 0 0
3.39/3.42 c leastinf : 0.00 0 0 0 0 0 0
3.39/3.42 c fullstrong : 0.00 0 0 0 0 0 0
3.39/3.42 c allfullstrong : 0.00 0 0 0 0 0 0
3.39/3.42 c random : 0.00 0 0 0 0 0 0
3.39/3.42 c Primal Heuristics : Time Calls Found
3.39/3.42 c LP solutions : 0.00 - 0
3.39/3.42 c pseudo solutions : 0.00 - 1
3.39/3.42 c oneopt : 0.00 0 0
3.39/3.42 c trivial : 0.00 2 0
3.39/3.42 c simplerounding : 0.00 0 0
3.39/3.42 c zirounding : 0.00 0 0
3.39/3.42 c rounding : 0.00 0 0
3.39/3.42 c shifting : 0.00 0 0
3.39/3.42 c intshifting : 0.00 0 0
3.39/3.42 c twoopt : 0.00 0 0
3.39/3.42 c fixandinfer : 0.00 0 0
3.39/3.42 c feaspump : 0.00 0 0
3.39/3.42 c coefdiving : 0.00 0 0
3.39/3.42 c pscostdiving : 0.00 0 0
3.39/3.42 c fracdiving : 0.00 0 0
3.39/3.42 c veclendiving : 0.00 0 0
3.39/3.42 c intdiving : 0.00 0 0
3.39/3.42 c actconsdiving : 0.00 0 0
3.39/3.42 c objpscostdiving : 0.00 0 0
3.39/3.42 c rootsoldiving : 0.00 0 0
3.39/3.42 c linesearchdiving : 0.00 0 0
3.39/3.42 c guideddiving : 0.00 0 0
3.39/3.42 c octane : 0.00 0 0
3.39/3.42 c rens : 0.00 0 0
3.39/3.42 c rins : 0.00 0 0
3.39/3.42 c localbranching : 0.00 0 0
3.39/3.42 c mutation : 0.00 0 0
3.39/3.42 c crossover : 0.00 0 0
3.39/3.42 c dins : 0.00 0 0
3.39/3.42 c undercover : 0.00 0 0
3.39/3.42 c nlp : 0.00 0 0
3.39/3.42 c trysol : 0.02 0 0
3.39/3.42 c LP : Time Calls Iterations Iter/call Iter/sec
3.39/3.42 c primal LP : 0.00 0 0 0.00 -
3.39/3.42 c dual LP : 0.00 0 0 0.00 -
3.39/3.42 c lex dual LP : 0.00 0 0 0.00 -
3.39/3.42 c barrier LP : 0.00 0 0 0.00 -
3.39/3.42 c diving/probing LP: 0.00 0 0 0.00 -
3.39/3.42 c strong branching : 0.00 0 0 0.00 -
3.39/3.42 c (at root node) : - 0 0 0.00 -
3.39/3.42 c conflict analysis: 0.00 0 0 0.00 -
3.39/3.42 c B&B Tree :
3.39/3.42 c number of runs : 1
3.39/3.42 c nodes : 15016
3.39/3.42 c nodes (total) : 15016
3.39/3.42 c nodes left : 0
3.39/3.42 c max depth : 137
3.39/3.42 c max depth (total): 137
3.39/3.42 c backtracks : 1521 (10.1%)
3.39/3.42 c delayed cutoffs : 10113
3.39/3.42 c repropagations : 4437 (14383 domain reductions, 1377 cutoffs)
3.39/3.42 c avg switch length: 4.23
3.39/3.42 c switching time : 0.43
3.39/3.42 c Solution :
3.39/3.42 c Solutions found : 1 (1 improvements)
3.39/3.42 c First Solution : +3.00000000000000e+00 (in run 1, after 15015 nodes, 3.00 seconds, depth 40, found by <relaxation>)
3.39/3.42 c Primal Bound : +3.00000000000000e+00 (in run 1, after 15015 nodes, 3.00 seconds, depth 40, found by <relaxation>)
3.39/3.42 c Dual Bound : +3.00000000000000e+00
3.39/3.42 c Gap : 0.00 %
3.39/3.42 c Root Dual Bound : +1.00000000000000e+00
3.39/3.42 c Root Iterations : 0
3.39/3.43 c Time complete: 3.43.