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-2663605-1276648070.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.04 c (round 2) 21 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1818 impls, 0 clqs
0.00/0.04 c (round 3) 31 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 8 upgd conss, 2218 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 8 upgd conss, 2538 impls, 0 clqs
0.00/0.05 c (round 5) 51 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 8 upgd conss, 2778 impls, 0 clqs
0.00/0.05 c (round 6) 61 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 8 upgd conss, 2938 impls, 0 clqs
0.00/0.05 c (round 7) 71 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 3018 impls, 0 clqs
0.00/0.06 c (round 8) 81 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 80 chg coeffs, 8 upgd conss, 3018 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 155/199 (77.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, 56 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 80 changed coefficients
0.00/0.07 c 3046 implications, 0 cliques
0.00/0.07 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 127 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 10 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 | - | 775k| 0 | - | 199 | 127 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.59/0.61 o 5
0.59/0.61 c * 0.5s| 3004 | 1860 | 0 | 0.0 |2260k| 57 | - | 199 | 711 | 0 | 0 | 0 |1044 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.89/1.98 o 3
1.89/1.98 c * 1.7s| 9217 | 271 | 0 | 0.0 |1890k| 57 | - | 199 | 988 | 0 | 0 | 0 |3025 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.89/1.98 c
1.89/1.98 c SCIP Status : problem is solved [optimal solution found]
1.89/1.98 c Solving Time (sec) : 1.73
1.89/1.98 c Solving Nodes : 9218
1.89/1.98 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.89/1.98 c Dual Bound : +3.00000000000000e+00
1.89/1.98 c Gap : 0.00 %
1.89/1.98 s OPTIMUM FOUND
1.89/1.98 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
1.89/1.98 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 -x48
1.89/1.98 v 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 x26
1.89/1.98 v -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.89/1.98 c SCIP Status : problem is solved [optimal solution found]
1.89/1.98 c Solving Time : 1.73
1.89/1.98 c Original Problem :
1.89/1.98 c Problem name : HOME/instance-2663605-1276648070.opb
1.89/1.98 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98 c Constraints : 190 initial, 190 maximal
1.89/1.98 c Presolved Problem :
1.89/1.98 c Problem name : t_HOME/instance-2663605-1276648070.opb
1.89/1.98 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98 c Constraints : 127 initial, 988 maximal
1.89/1.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.98 c trivial : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c probing : 0.01 0 0 0 0 0 0 0 0
1.89/1.98 c and : 0.02 14 56 0 0 0 56 0 56
1.89/1.98 c linear : 0.00 3 8 0 0 0 0 0 24
1.89/1.98 c logicor : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c root node : - 19 - - 19 - - - -
1.89/1.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.98 c integral : 0 0 0 0 0 0 0 0 0 0
1.89/1.98 c and : 110 0 25121 0 8083 384 26615 0 0 0
1.89/1.98 c linear : 7 0 24736 0 8083 1095 16268 0 0 0
1.89/1.98 c logicor : 10+ 0 12526 0 8084 82 4187 0 0 0
1.89/1.98 c countsols : 0 0 0 0 8085 0 0 0 0 0
1.89/1.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.98 c integral : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c and : 0.18 0.00 0.17 0.00 0.01
1.89/1.98 c linear : 0.38 0.00 0.37 0.00 0.01
1.89/1.98 c logicor : 0.17 0.00 0.16 0.00 0.01
1.89/1.98 c countsols : 0.01 0.00 0.00 0.00 0.01
1.89/1.98 c Propagators : Time Calls Cutoffs DomReds
1.89/1.98 c vbounds : 0.00 2 0 0
1.89/1.98 c rootredcost : 0.01 0 0 0
1.89/1.98 c pseudoobj : 0.00 24803 3 165
1.89/1.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.98 c propagation : 0.12 1564 1550 10878 22.2 179 19.1 -
1.89/1.98 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c pseudo solution : 0.00 1 1 1 0.0 0 0.0 -
1.89/1.98 c applied globally : - - - 3024 15.8 - - -
1.89/1.98 c applied locally : - - - 1 33.0 - - -
1.89/1.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.98 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.89/1.98 c redcost : 0.00 0 0 0 0 0
1.89/1.98 c impliedbounds : 0.00 0 0 0 0 0
1.89/1.98 c intobj : 0.00 0 0 0 0 0
1.89/1.98 c cgmip : 0.00 0 0 0 0 0
1.89/1.98 c gomory : 0.00 0 0 0 0 0
1.89/1.98 c strongcg : 0.00 0 0 0 0 0
1.89/1.98 c cmir : 0.00 0 0 0 0 0
1.89/1.98 c flowcover : 0.00 0 0 0 0 0
1.89/1.98 c clique : 0.00 0 0 0 0 0
1.89/1.98 c zerohalf : 0.00 0 0 0 0 0
1.89/1.98 c mcf : 0.00 0 0 0 0 0
1.89/1.98 c rapidlearning : 0.00 0 0 0 0 0
1.89/1.98 c Pricers : Time Calls Vars
1.89/1.98 c problem variables: 0.00 0 0
1.89/1.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.98 c relpscost : 0.00 0 0 0 0 0 0
1.89/1.98 c pscost : 0.00 0 0 0 0 0 0
1.89/1.98 c inference : 0.16 8083 0 0 0 0 16166
1.89/1.98 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.98 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.98 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.98 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.98 c random : 0.00 0 0 0 0 0 0
1.89/1.98 c Primal Heuristics : Time Calls Found
1.89/1.98 c LP solutions : 0.00 - 0
1.89/1.98 c pseudo solutions : 0.01 - 2
1.89/1.98 c oneopt : 0.00 0 0
1.89/1.98 c trivial : 0.00 2 0
1.89/1.98 c simplerounding : 0.00 0 0
1.89/1.98 c zirounding : 0.00 0 0
1.89/1.98 c rounding : 0.00 0 0
1.89/1.98 c shifting : 0.00 0 0
1.89/1.98 c intshifting : 0.00 0 0
1.89/1.98 c twoopt : 0.00 0 0
1.89/1.98 c fixandinfer : 0.00 0 0
1.89/1.98 c feaspump : 0.00 0 0
1.89/1.98 c coefdiving : 0.00 0 0
1.89/1.98 c pscostdiving : 0.00 0 0
1.89/1.98 c fracdiving : 0.00 0 0
1.89/1.98 c veclendiving : 0.00 0 0
1.89/1.98 c intdiving : 0.00 0 0
1.89/1.98 c actconsdiving : 0.00 0 0
1.89/1.98 c objpscostdiving : 0.00 0 0
1.89/1.98 c rootsoldiving : 0.00 0 0
1.89/1.98 c linesearchdiving : 0.00 0 0
1.89/1.98 c guideddiving : 0.00 0 0
1.89/1.98 c octane : 0.00 0 0
1.89/1.98 c rens : 0.00 0 0
1.89/1.98 c rins : 0.00 0 0
1.89/1.98 c localbranching : 0.00 0 0
1.89/1.98 c mutation : 0.00 0 0
1.89/1.98 c crossover : 0.00 0 0
1.89/1.98 c dins : 0.00 0 0
1.89/1.98 c undercover : 0.00 0 0
1.89/1.98 c nlp : 0.01 0 0
1.89/1.98 c trysol : 0.00 0 0
1.89/1.98 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.98 c primal LP : 0.00 0 0 0.00 -
1.89/1.98 c dual LP : 0.00 0 0 0.00 -
1.89/1.98 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.98 c barrier LP : 0.00 0 0 0.00 -
1.89/1.98 c diving/probing LP: 0.00 0 0 0.00 -
1.89/1.98 c strong branching : 0.00 0 0 0.00 -
1.89/1.98 c (at root node) : - 0 0 0.00 -
1.89/1.98 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.98 c B&B Tree :
1.89/1.98 c number of runs : 1
1.89/1.98 c nodes : 9218
1.89/1.98 c nodes (total) : 9218
1.89/1.98 c nodes left : 0
1.89/1.98 c max depth : 57
1.89/1.98 c max depth (total): 57
1.89/1.98 c backtracks : 1652 (17.9%)
1.89/1.98 c delayed cutoffs : 1154
1.89/1.98 c repropagations : 3921 (7372 domain reductions, 432 cutoffs)
1.89/1.98 c avg switch length: 7.16
1.89/1.98 c switching time : 0.36
1.89/1.98 c Solution :
1.89/1.98 c Solutions found : 2 (2 improvements)
1.89/1.98 c First Solution : +5.00000000000000e+00 (in run 1, after 3004 nodes, 0.51 seconds, depth 41, found by <relaxation>)
1.89/1.98 c Primal Bound : +3.00000000000000e+00 (in run 1, after 9217 nodes, 1.71 seconds, depth 46, found by <relaxation>)
1.89/1.98 c Dual Bound : +3.00000000000000e+00
1.89/1.98 c Gap : 0.00 %
1.89/1.98 c Root Dual Bound : +1.00000000000000e+00
1.89/1.98 c Root Iterations : 0
1.89/1.99 c Time complete: 1.98.