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-2663541-1276646847.opb>
0.00/0.01 c original problem has 378 variables (378 bin, 0 int, 0 impl, 0 cont) and 267 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.05 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1596 impls, 0 clqs
0.00/0.05 c (round 2) 19 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 8 upgd conss, 2316 impls, 0 clqs
0.00/0.06 c (round 3) 31 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 8 upgd conss, 2916 impls, 0 clqs
0.00/0.06 c (round 4) 43 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 8 upgd conss, 3396 impls, 0 clqs
0.00/0.06 c (round 5) 55 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 3756 impls, 0 clqs
0.00/0.07 c (round 6) 67 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 82 chg coeffs, 8 upgd conss, 3996 impls, 0 clqs
0.00/0.07 c (round 7) 79 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 8 upgd conss, 4116 impls, 0 clqs
0.00/0.07 c (round 8) 91 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 8 upgd conss, 4116 impls, 0 clqs
0.00/0.09 c (0.1s) probing: 167/287 (58.2%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.00/0.09 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.09 c presolving (9 rounds):
0.00/0.09 c 91 deleted vars, 70 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 102 changed coefficients
0.00/0.09 c 4144 implications, 0 cliques
0.00/0.09 c presolved problem has 287 variables (287 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.00/0.09 c 175 constraints of type <and>
0.00/0.09 c 7 constraints of type <linear>
0.00/0.09 c 8 constraints of type <logicor>
0.00/0.09 c transformed objective value is always integral (scale: 2)
0.00/0.09 c Presolving Time: 0.05
0.00/0.09 c - non default parameters ----------------------------------------------------------------------
0.00/0.09 c # SCIP version 1.2.1.2
0.00/0.09 c
0.00/0.09 c # frequency for displaying node information lines
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.09 c display/freq = 10000
0.00/0.09 c
0.00/0.09 c # maximal time in seconds to run
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/time = 1800
0.00/0.09 c
0.00/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/memory = 1620
0.00/0.09 c
0.00/0.09 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c lp/solvefreq = -1
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify inequalities
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/linear/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify knapsacks
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c heuristics/undercover/freq = 0
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/rapidlearning/freq = 0
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.00/0.09 c
0.00/0.09 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.09 c 0.1s| 1 | 2 | 0 | - |1017k| 0 | - | 287 | 190 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.88/1.93 c 1.6s| 10000 | 8099 | 0 | 0.0 |6417k| 123 | - | 287 | 456 | 0 | 0 | 0 |1330 | 0 | 1.000000e+00 | -- | Inf
2.99/3.00 o 5
2.99/3.00 c * 2.5s| 15411 | 3179 | 0 | 0.0 |4400k| 123 | - | 287 | 687 | 0 | 0 | 0 |2268 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
3.79/3.81 c 3.2s| 20000 | 7497 | 0 | 0.0 |6841k| 123 | - | 287 | 300 | 0 | 0 | 0 |2390 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
4.39/4.50 o 3
4.39/4.50 c * 3.8s| 23650 | 142 | 0 | 0.0 |1607k| 123 | - | 287 | 414 | 0 | 0 | 0 |2777 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
4.39/4.50 c
4.39/4.50 c SCIP Status : problem is solved [optimal solution found]
4.39/4.50 c Solving Time (sec) : 3.83
4.39/4.50 c Solving Nodes : 23651
4.39/4.50 c Primal Bound : +3.00000000000000e+00 (2 solutions)
4.39/4.50 c Dual Bound : +3.00000000000000e+00
4.39/4.50 c Gap : 0.00 %
4.39/4.50 s OPTIMUM FOUND
4.39/4.50 v -x126 -x125 -x124 -x123 -x122 x121 -x120 -x119 -x118 -x117 x116 -x115 -x84 -x83 -x82 x81 x80 x79 -x114 -x113 -x112 -x111 -x110
4.39/4.50 v -x109 -x78 -x77 -x76 -x75 x74 x73 -x108 x107 -x106 -x105 -x104 x103 -x72 -x71 -x70 -x69 -x68 x67 -x102 -x101 -x100 -x99 -x98
4.39/4.50 v -x97 x66 -x65 -x64 -x63 -x62 x61 -x96 -x95 -x94 x93 x92 -x91 -x60 -x59 -x58 -x57 -x56 x55 -x90 -x89 -x88 -x87 -x86 x85 x54 -x53
4.39/4.50 v -x52 -x51 x50 x49 -x48 x47 -x46 -x45 -x44 x43 x42 -x41 x40 x39 -x38 x37 -x36 -x35 -x34 -x33 x32 x31 x30 -x29 -x28 -x27 -x26
4.39/4.50 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
4.39/4.50 c SCIP Status : problem is solved [optimal solution found]
4.39/4.50 c Solving Time : 3.83
4.39/4.50 c Original Problem :
4.39/4.50 c Problem name : HOME/instance-2663541-1276646847.opb
4.39/4.50 c Variables : 378 (378 binary, 0 integer, 0 implicit integer, 0 continuous)
4.39/4.50 c Constraints : 267 initial, 267 maximal
4.39/4.50 c Presolved Problem :
4.39/4.50 c Problem name : t_HOME/instance-2663541-1276646847.opb
4.39/4.50 c Variables : 287 (287 binary, 0 integer, 0 implicit integer, 0 continuous)
4.39/4.50 c Constraints : 190 initial, 687 maximal
4.39/4.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.39/4.50 c trivial : 0.00 0 0 0 0 0 0 0 0
4.39/4.50 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.39/4.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.39/4.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.39/4.50 c implics : 0.00 0 0 0 0 0 0 0 0
4.39/4.50 c probing : 0.02 0 0 0 0 0 0 0 0
4.39/4.50 c and : 0.01 14 70 0 0 0 70 0 70
4.39/4.50 c linear : 0.01 1 6 0 0 0 0 0 32
4.39/4.50 c logicor : 0.00 0 0 0 0 0 0 0 0
4.39/4.50 c root node : - 29 - - 29 - - - -
4.39/4.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.39/4.50 c integral : 0 0 0 0 0 0 0 0 0 0
4.39/4.50 c and : 175 0 55831 0 22107 466 85108 0 0 0
4.39/4.50 c linear : 7 0 55364 0 22107 1627 35602 0 0 0
4.39/4.50 c logicor : 8+ 0 23096 0 22108 189 6422 0 0 0
4.39/4.50 c countsols : 0 0 0 0 22109 0 0 0 0 0
4.39/4.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.39/4.50 c integral : 0.00 0.00 0.00 0.00 0.00
4.39/4.50 c and : 0.55 0.00 0.37 0.00 0.18
4.39/4.50 c linear : 0.99 0.00 0.96 0.00 0.03
4.39/4.50 c logicor : 0.16 0.00 0.11 0.00 0.05
4.39/4.50 c countsols : 0.01 0.00 0.00 0.00 0.01
4.39/4.50 c Propagators : Time Calls Cutoffs DomReds
4.39/4.50 c vbounds : 0.00 2 0 0
4.39/4.50 c rootredcost : 0.02 0 0 0
4.39/4.50 c pseudoobj : 0.08 55492 4 207
4.39/4.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.39/4.50 c propagation : 0.26 2286 2253 16837 31.6 248 30.6 -
4.39/4.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.39/4.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.39/4.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.39/4.50 c pseudo solution : 0.00 1 1 1 0.0 0 0.0 -
4.39/4.50 c applied globally : - - - 2690 16.1 - - -
4.39/4.50 c applied locally : - - - 87 36.6 - - -
4.39/4.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.39/4.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
4.39/4.50 c redcost : 0.00 0 0 0 0 0
4.39/4.50 c impliedbounds : 0.00 0 0 0 0 0
4.39/4.50 c intobj : 0.00 0 0 0 0 0
4.39/4.50 c cgmip : 0.00 0 0 0 0 0
4.39/4.50 c gomory : 0.00 0 0 0 0 0
4.39/4.50 c strongcg : 0.00 0 0 0 0 0
4.39/4.50 c cmir : 0.00 0 0 0 0 0
4.39/4.50 c flowcover : 0.00 0 0 0 0 0
4.39/4.50 c clique : 0.00 0 0 0 0 0
4.39/4.50 c zerohalf : 0.00 0 0 0 0 0
4.39/4.50 c mcf : 0.00 0 0 0 0 0
4.39/4.50 c rapidlearning : 0.00 0 0 0 0 0
4.39/4.50 c Pricers : Time Calls Vars
4.39/4.50 c problem variables: 0.00 0 0
4.39/4.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.39/4.50 c relpscost : 0.00 0 0 0 0 0 0
4.39/4.50 c pscost : 0.00 0 0 0 0 0 0
4.39/4.50 c inference : 0.70 22107 0 0 0 0 44214
4.39/4.50 c mostinf : 0.00 0 0 0 0 0 0
4.39/4.50 c leastinf : 0.00 0 0 0 0 0 0
4.39/4.50 c fullstrong : 0.00 0 0 0 0 0 0
4.39/4.50 c allfullstrong : 0.00 0 0 0 0 0 0
4.39/4.50 c random : 0.00 0 0 0 0 0 0
4.39/4.50 c Primal Heuristics : Time Calls Found
4.39/4.50 c LP solutions : 0.00 - 0
4.39/4.50 c pseudo solutions : 0.03 - 2
4.39/4.50 c oneopt : 0.00 0 0
4.39/4.50 c trivial : 0.00 2 0
4.39/4.50 c simplerounding : 0.00 0 0
4.39/4.50 c zirounding : 0.00 0 0
4.39/4.50 c rounding : 0.00 0 0
4.39/4.50 c shifting : 0.00 0 0
4.39/4.50 c intshifting : 0.00 0 0
4.39/4.50 c twoopt : 0.00 0 0
4.39/4.50 c fixandinfer : 0.00 0 0
4.39/4.50 c feaspump : 0.00 0 0
4.39/4.50 c coefdiving : 0.00 0 0
4.39/4.50 c pscostdiving : 0.00 0 0
4.39/4.50 c fracdiving : 0.00 0 0
4.39/4.50 c veclendiving : 0.00 0 0
4.39/4.50 c intdiving : 0.00 0 0
4.39/4.50 c actconsdiving : 0.00 0 0
4.39/4.50 c objpscostdiving : 0.00 0 0
4.39/4.50 c rootsoldiving : 0.00 0 0
4.39/4.50 c linesearchdiving : 0.00 0 0
4.39/4.50 c guideddiving : 0.00 0 0
4.39/4.50 c octane : 0.00 0 0
4.39/4.50 c rens : 0.00 0 0
4.39/4.50 c rins : 0.00 0 0
4.39/4.50 c localbranching : 0.00 0 0
4.39/4.50 c mutation : 0.00 0 0
4.39/4.50 c crossover : 0.00 0 0
4.39/4.50 c dins : 0.00 0 0
4.39/4.50 c undercover : 0.00 0 0
4.39/4.50 c nlp : 0.01 0 0
4.39/4.50 c trysol : 0.00 0 0
4.39/4.50 c LP : Time Calls Iterations Iter/call Iter/sec
4.39/4.50 c primal LP : 0.00 0 0 0.00 -
4.39/4.50 c dual LP : 0.00 0 0 0.00 -
4.39/4.50 c lex dual LP : 0.00 0 0 0.00 -
4.39/4.50 c barrier LP : 0.00 0 0 0.00 -
4.39/4.50 c diving/probing LP: 0.00 0 0 0.00 -
4.39/4.50 c strong branching : 0.00 0 0 0.00 -
4.39/4.50 c (at root node) : - 0 0 0.00 -
4.39/4.50 c conflict analysis: 0.00 0 0 0.00 -
4.39/4.50 c B&B Tree :
4.39/4.50 c number of runs : 1
4.39/4.50 c nodes : 23651
4.39/4.50 c nodes (total) : 23651
4.39/4.50 c nodes left : 0
4.39/4.50 c max depth : 123
4.39/4.50 c max depth (total): 123
4.39/4.50 c backtracks : 1823 (7.7%)
4.39/4.50 c delayed cutoffs : 1171
4.39/4.50 c repropagations : 3981 (8883 domain reductions, 745 cutoffs)
4.39/4.50 c avg switch length: 4.02
4.39/4.50 c switching time : 0.46
4.39/4.50 c Solution :
4.39/4.50 c Solutions found : 2 (2 improvements)
4.39/4.50 c First Solution : +5.00000000000000e+00 (in run 1, after 15411 nodes, 2.51 seconds, depth 80, found by <relaxation>)
4.39/4.50 c Primal Bound : +3.00000000000000e+00 (in run 1, after 23650 nodes, 3.80 seconds, depth 46, found by <relaxation>)
4.39/4.50 c Dual Bound : +3.00000000000000e+00
4.39/4.50 c Gap : 0.00 %
4.39/4.50 c Root Dual Bound : +1.00000000000000e+00
4.39/4.50 c Root Iterations : 0
4.50/4.51 c Time complete: 4.5.