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-2663557-1276647205.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 190 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) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1264 impls, 0 clqs
0.00/0.03 c (round 2) 20 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1799 impls, 0 clqs
0.00/0.04 c (round 3) 31 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 8 upgd conss, 2199 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 8 upgd conss, 2519 impls, 0 clqs
0.00/0.04 c (round 5) 51 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 8 upgd conss, 2759 impls, 0 clqs
0.00/0.05 c (round 6) 61 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 8 upgd conss, 2919 impls, 0 clqs
0.00/0.05 c (round 7) 71 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.05 c (round 8) 81 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 151/199 (75.9%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (9 rounds):
0.00/0.07 c 81 deleted vars, 57 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 81 changed coefficients
0.00/0.07 c 3027 implications, 0 cliques
0.00/0.07 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 126 constraints
0.00/0.07 c 110 constraints of type <and>
0.00/0.07 c 7 constraints of type <linear>
0.00/0.07 c 9 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 2)
0.00/0.07 c Presolving Time: 0.04
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = -1
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c heuristics/undercover/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 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 | - | 774k| 0 | - | 199 | 126 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.09/0.16 o 3
0.09/0.16 c * 0.1s| 624 | 468 | 0 | 0.0 |1131k| 59 | - | 199 | 273 | 0 | 0 | 0 | 147 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.09/0.16 c
0.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time (sec) : 0.11
0.09/0.16 c Solving Nodes : 625
0.09/0.16 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.09/0.16 c Dual Bound : +3.00000000000000e+00
0.09/0.16 c Gap : 0.00 %
0.09/0.16 s OPTIMUM FOUND
0.09/0.16 v -x105 -x104 -x103 x102 -x101 -x100 -x99 -x98 -x97 -x96 -x70 -x69 -x68 x67 x66 -x95 -x94 -x93 -x92 x91 -x65 -x64 -x63 -x62 x61 -x90
0.09/0.16 v -x89 -x88 -x87 -x86 -x60 -x59 -x58 x57 x56 -x85 -x84 -x83 x82 -x81 -x55 -x54 -x53 -x52 x51 -x80 -x79 -x78 -x77 x76 -x50 x49
0.09/0.16 v x48 -x47 x46 -x75 -x74 -x73 -x72 -x71 -x45 x44 x43 x42 x41 x40 x39 -x38 -x37 x36 -x35 -x34 -x33 x32 x31 -x30 x29 -x28 x27
0.09/0.16 v 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
0.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time : 0.11
0.09/0.16 c Original Problem :
0.09/0.16 c Problem name : HOME/instance-2663557-1276647205.opb
0.09/0.16 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 190 initial, 190 maximal
0.09/0.16 c Presolved Problem :
0.09/0.16 c Problem name : t_HOME/instance-2663557-1276647205.opb
0.09/0.16 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 126 initial, 274 maximal
0.09/0.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.16 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c probing : 0.02 0 0 0 0 0 0 0 0
0.09/0.16 c and : 0.01 14 57 0 0 0 57 0 57
0.09/0.16 c linear : 0.00 2 8 0 0 0 0 0 24
0.09/0.16 c logicor : 0.01 0 0 0 0 0 0 0 0
0.09/0.16 c root node : - 25 - - 25 - - - -
0.09/0.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.16 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.16 c and : 110 0 1727 0 565 22 1445 0 0 0
0.09/0.16 c linear : 7 0 1705 0 565 57 843 0 0 0
0.09/0.16 c logicor : 9+ 0 525 0 566 8 267 0 0 0
0.09/0.16 c countsols : 0 0 0 0 566 0 0 0 0 0
0.09/0.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.16 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c and : 0.01 0.00 0.01 0.00 0.00
0.09/0.16 c linear : 0.03 0.00 0.03 0.00 0.00
0.09/0.16 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c Propagators : Time Calls Cutoffs DomReds
0.09/0.16 c vbounds : 0.01 2 0 0
0.09/0.16 c rootredcost : 0.00 0 0 0
0.09/0.16 c pseudoobj : 0.00 1415 0 8
0.09/0.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.16 c propagation : 0.00 87 86 451 20.5 19 16.1 -
0.09/0.16 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c applied globally : - - - 148 13.7 - - -
0.09/0.16 c applied locally : - - - 0 0.0 - - -
0.09/0.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.16 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.16 c redcost : 0.00 0 0 0 0 0
0.09/0.16 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.16 c intobj : 0.00 0 0 0 0 0
0.09/0.16 c cgmip : 0.00 0 0 0 0 0
0.09/0.16 c gomory : 0.00 0 0 0 0 0
0.09/0.16 c strongcg : 0.00 0 0 0 0 0
0.09/0.16 c cmir : 0.00 0 0 0 0 0
0.09/0.16 c flowcover : 0.00 0 0 0 0 0
0.09/0.16 c clique : 0.00 0 0 0 0 0
0.09/0.16 c zerohalf : 0.00 0 0 0 0 0
0.09/0.16 c mcf : 0.00 0 0 0 0 0
0.09/0.16 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.16 c Pricers : Time Calls Vars
0.09/0.16 c problem variables: 0.00 0 0
0.09/0.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.16 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.16 c pscost : 0.00 0 0 0 0 0 0
0.09/0.16 c inference : 0.00 565 0 0 0 0 1130
0.09/0.16 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.16 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.16 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c random : 0.00 0 0 0 0 0 0
0.09/0.16 c Primal Heuristics : Time Calls Found
0.09/0.16 c LP solutions : 0.00 - 0
0.09/0.16 c pseudo solutions : 0.00 - 1
0.09/0.16 c oneopt : 0.00 0 0
0.09/0.16 c trivial : 0.00 2 0
0.09/0.16 c simplerounding : 0.00 0 0
0.09/0.16 c zirounding : 0.00 0 0
0.09/0.16 c rounding : 0.00 0 0
0.09/0.16 c shifting : 0.00 0 0
0.09/0.16 c intshifting : 0.00 0 0
0.09/0.16 c twoopt : 0.00 0 0
0.09/0.16 c fixandinfer : 0.00 0 0
0.09/0.16 c feaspump : 0.00 0 0
0.09/0.16 c coefdiving : 0.00 0 0
0.09/0.16 c pscostdiving : 0.00 0 0
0.09/0.16 c fracdiving : 0.00 0 0
0.09/0.16 c veclendiving : 0.00 0 0
0.09/0.16 c intdiving : 0.00 0 0
0.09/0.16 c actconsdiving : 0.00 0 0
0.09/0.16 c objpscostdiving : 0.00 0 0
0.09/0.16 c rootsoldiving : 0.00 0 0
0.09/0.16 c linesearchdiving : 0.00 0 0
0.09/0.16 c guideddiving : 0.00 0 0
0.09/0.16 c octane : 0.00 0 0
0.09/0.16 c rens : 0.00 0 0
0.09/0.16 c rins : 0.00 0 0
0.09/0.16 c localbranching : 0.00 0 0
0.09/0.16 c mutation : 0.00 0 0
0.09/0.16 c crossover : 0.00 0 0
0.09/0.16 c dins : 0.00 0 0
0.09/0.16 c undercover : 0.00 0 0
0.09/0.16 c nlp : 0.00 0 0
0.09/0.16 c trysol : 0.00 0 0
0.09/0.16 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.16 c primal LP : 0.00 0 0 0.00 -
0.09/0.16 c dual LP : 0.00 0 0 0.00 -
0.09/0.16 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.16 c barrier LP : 0.00 0 0 0.00 -
0.09/0.16 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.16 c strong branching : 0.00 0 0 0.00 -
0.09/0.16 c (at root node) : - 0 0 0.00 -
0.09/0.16 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.16 c B&B Tree :
0.09/0.16 c number of runs : 1
0.09/0.16 c nodes : 625
0.09/0.16 c nodes (total) : 625
0.09/0.16 c nodes left : 0
0.09/0.16 c max depth : 59
0.09/0.16 c max depth (total): 59
0.09/0.16 c backtracks : 39 (6.2%)
0.09/0.16 c delayed cutoffs : 494
0.09/0.16 c repropagations : 132 (318 domain reductions, 28 cutoffs)
0.09/0.16 c avg switch length: 2.41
0.09/0.16 c switching time : 0.00
0.09/0.16 c Solution :
0.09/0.16 c Solutions found : 1 (1 improvements)
0.09/0.16 c First Solution : +3.00000000000000e+00 (in run 1, after 624 nodes, 0.11 seconds, depth 59, found by <relaxation>)
0.09/0.16 c Primal Bound : +3.00000000000000e+00 (in run 1, after 624 nodes, 0.11 seconds, depth 59, found by <relaxation>)
0.09/0.16 c Dual Bound : +3.00000000000000e+00
0.09/0.16 c Gap : 0.00 %
0.09/0.16 c Root Dual Bound : +1.00000000000000e+00
0.09/0.16 c Root Iterations : 0
0.09/0.17 c Time complete: 0.16.