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-2663520-1276646159.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 205 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) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 0 upgd conss, 976 impls, 0 clqs
0.00/0.04 c (round 2) 18 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 5 upgd conss, 1480 impls, 0 clqs
0.00/0.04 c (round 3) 32 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1816 impls, 0 clqs
0.00/0.05 c (round 4) 46 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 61 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.05 c (round 5) 60 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 144/220 (65.5%) - 0 fixings, 0 aggregations, 8 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 (6 rounds):
0.00/0.06 c 60 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 73 changed coefficients
0.00/0.06 c 2000 implications, 0 cliques
0.00/0.06 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 153 constraints
0.00/0.06 c 144 constraints of type <and>
0.00/0.06 c 4 constraints of type <linear>
0.00/0.06 c 5 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.07 c
0.00/0.07 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.07 c 0.0s| 1 | 2 | 0 | - | 783k| 0 | - | 220 | 153 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.29/1.38 o 3
1.29/1.38 c * 1.2s| 6187 | 3062 | 0 | 0.0 |3649k| 89 | - | 220 | 868 | 0 | 0 | 0 |1778 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.29/1.39 c
1.29/1.39 c SCIP Status : problem is solved [optimal solution found]
1.29/1.39 c Solving Time (sec) : 1.22
1.29/1.39 c Solving Nodes : 6188
1.29/1.39 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.29/1.39 c Dual Bound : +3.00000000000000e+00
1.29/1.39 c Gap : 0.00 %
1.29/1.39 s OPTIMUM FOUND
1.29/1.39 v -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x56 -x55 -x54 -x53 x52 -x51 x50 -x70 -x69 -x68 -x67 x66
1.29/1.39 v -x65 -x64 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x42 -x41 -x40 x39 -x38 -x37 x36 -x35 -x34 -x33
1.29/1.39 v -x32 x31 x30 x29 -x28 -x27 -x26 -x25 x24 -x23 x22 -x21 x20 x19 x18 -x17 -x16 x15 -x14 -x13 -x12 -x11 -x10 x9 x8 -x7 -x6 -x5
1.29/1.39 v -x4 -x3 x2 x1
1.29/1.39 c SCIP Status : problem is solved [optimal solution found]
1.29/1.39 c Solving Time : 1.22
1.29/1.39 c Original Problem :
1.29/1.39 c Problem name : HOME/instance-2663520-1276646159.opb
1.29/1.39 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.39 c Constraints : 205 initial, 205 maximal
1.29/1.39 c Presolved Problem :
1.29/1.39 c Problem name : t_HOME/instance-2663520-1276646159.opb
1.29/1.39 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.39 c Constraints : 153 initial, 893 maximal
1.29/1.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.39 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c probing : 0.01 0 0 0 0 0 0 0 0
1.29/1.39 c and : 0.01 8 48 0 0 0 48 0 48
1.29/1.39 c linear : 0.00 1 3 0 0 0 0 0 25
1.29/1.39 c logicor : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c root node : - 49 - - 49 - - - -
1.29/1.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.39 c integral : 0 0 0 0 0 0 0 0 0 0
1.29/1.39 c and : 144 0 15439 0 5165 286 23674 0 0 0
1.29/1.39 c linear : 4 0 15152 0 5165 1201 11779 0 0 0
1.29/1.39 c logicor : 5+ 0 6076 0 5164 100 1908 0 0 0
1.29/1.39 c countsols : 0 0 0 0 5166 0 0 0 0 0
1.29/1.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.39 c integral : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c and : 0.21 0.00 0.12 0.00 0.09
1.29/1.39 c linear : 0.32 0.00 0.31 0.00 0.01
1.29/1.39 c logicor : 0.06 0.00 0.05 0.00 0.01
1.29/1.39 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c Propagators : Time Calls Cutoffs DomReds
1.29/1.39 c vbounds : 0.00 2 0 0
1.29/1.39 c rootredcost : 0.00 0 0 0
1.29/1.39 c pseudoobj : 0.00 15145 0 12
1.29/1.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.39 c propagation : 0.15 1587 1559 11029 41.3 133 42.1 -
1.29/1.39 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.39 c applied globally : - - - 1255 18.8 - - -
1.29/1.39 c applied locally : - - - 524 40.9 - - -
1.29/1.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.39 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.29/1.39 c redcost : 0.00 0 0 0 0 0
1.29/1.39 c impliedbounds : 0.00 0 0 0 0 0
1.29/1.39 c intobj : 0.00 0 0 0 0 0
1.29/1.39 c cgmip : 0.00 0 0 0 0 0
1.29/1.39 c gomory : 0.00 0 0 0 0 0
1.29/1.39 c strongcg : 0.00 0 0 0 0 0
1.29/1.39 c cmir : 0.00 0 0 0 0 0
1.29/1.39 c flowcover : 0.00 0 0 0 0 0
1.29/1.39 c clique : 0.00 0 0 0 0 0
1.29/1.39 c zerohalf : 0.00 0 0 0 0 0
1.29/1.39 c mcf : 0.00 0 0 0 0 0
1.29/1.39 c rapidlearning : 0.00 0 0 0 0 0
1.29/1.39 c Pricers : Time Calls Vars
1.29/1.39 c problem variables: 0.00 0 0
1.29/1.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.39 c relpscost : 0.00 0 0 0 0 0 0
1.29/1.39 c pscost : 0.00 0 0 0 0 0 0
1.29/1.39 c inference : 0.16 5165 0 0 0 0 10330
1.29/1.39 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.39 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.39 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.39 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.39 c random : 0.00 0 0 0 0 0 0
1.29/1.39 c Primal Heuristics : Time Calls Found
1.29/1.39 c LP solutions : 0.00 - 0
1.29/1.39 c pseudo solutions : 0.00 - 1
1.29/1.39 c oneopt : 0.00 0 0
1.29/1.39 c trivial : 0.00 2 0
1.29/1.39 c simplerounding : 0.00 0 0
1.29/1.39 c zirounding : 0.00 0 0
1.29/1.39 c rounding : 0.00 0 0
1.29/1.39 c shifting : 0.00 0 0
1.29/1.39 c intshifting : 0.00 0 0
1.29/1.39 c twoopt : 0.00 0 0
1.29/1.39 c fixandinfer : 0.00 0 0
1.29/1.39 c feaspump : 0.00 0 0
1.29/1.39 c coefdiving : 0.00 0 0
1.29/1.39 c pscostdiving : 0.00 0 0
1.29/1.39 c fracdiving : 0.00 0 0
1.29/1.39 c veclendiving : 0.00 0 0
1.29/1.39 c intdiving : 0.00 0 0
1.29/1.39 c actconsdiving : 0.00 0 0
1.29/1.39 c objpscostdiving : 0.00 0 0
1.29/1.39 c rootsoldiving : 0.00 0 0
1.29/1.39 c linesearchdiving : 0.00 0 0
1.29/1.39 c guideddiving : 0.00 0 0
1.29/1.39 c octane : 0.00 0 0
1.29/1.39 c rens : 0.00 0 0
1.29/1.39 c rins : 0.00 0 0
1.29/1.39 c localbranching : 0.00 0 0
1.29/1.39 c mutation : 0.00 0 0
1.29/1.39 c crossover : 0.00 0 0
1.29/1.39 c dins : 0.00 0 0
1.29/1.39 c undercover : 0.00 0 0
1.29/1.39 c nlp : 0.02 0 0
1.29/1.39 c trysol : 0.00 0 0
1.29/1.39 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.39 c primal LP : 0.00 0 0 0.00 -
1.29/1.39 c dual LP : 0.00 0 0 0.00 -
1.29/1.39 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.39 c barrier LP : 0.00 0 0 0.00 -
1.29/1.39 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.39 c strong branching : 0.00 0 0 0.00 -
1.29/1.39 c (at root node) : - 0 0 0.00 -
1.29/1.39 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.39 c B&B Tree :
1.29/1.39 c number of runs : 1
1.29/1.39 c nodes : 6188
1.29/1.39 c nodes (total) : 6188
1.29/1.39 c nodes left : 0
1.29/1.39 c max depth : 89
1.29/1.39 c max depth (total): 89
1.29/1.39 c backtracks : 736 (11.9%)
1.29/1.39 c delayed cutoffs : 3695
1.29/1.39 c repropagations : 1633 (6711 domain reductions, 565 cutoffs)
1.29/1.39 c avg switch length: 3.83
1.29/1.39 c switching time : 0.16
1.29/1.39 c Solution :
1.29/1.39 c Solutions found : 1 (1 improvements)
1.29/1.39 c First Solution : +3.00000000000000e+00 (in run 1, after 6187 nodes, 1.21 seconds, depth 87, found by <relaxation>)
1.29/1.39 c Primal Bound : +3.00000000000000e+00 (in run 1, after 6187 nodes, 1.21 seconds, depth 87, found by <relaxation>)
1.29/1.39 c Dual Bound : +3.00000000000000e+00
1.29/1.39 c Gap : 0.00 %
1.29/1.39 c Root Dual Bound : +1.00000000000000e+00
1.29/1.39 c Root Iterations : 0
1.39/1.40 c Time complete: 1.39.