0.00/0.01 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2663570-1276647459.opb>
0.00/0.01 c original problem has 324 variables (324 bin, 0 int, 0 impl, 0 cont) and 229 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) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 0 upgd conss, 1284 impls, 0 clqs
0.00/0.04 c (round 2) 18 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 7 upgd conss, 1884 impls, 0 clqs
0.00/0.05 c (round 3) 30 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 7 upgd conss, 2364 impls, 0 clqs
0.00/0.05 c (round 4) 42 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 7 upgd conss, 2724 impls, 0 clqs
0.00/0.06 c (round 5) 54 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 68 chg coeffs, 7 upgd conss, 2964 impls, 0 clqs
0.00/0.06 c (round 6) 66 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 78 chg coeffs, 7 upgd conss, 3084 impls, 0 clqs
0.00/0.06 c (round 7) 78 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 7 upgd conss, 3084 impls, 0 clqs
0.07/0.08 c (0.0s) probing: 157/246 (63.8%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.07/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.07/0.08 c presolving (8 rounds):
0.07/0.08 c 78 deleted vars, 60 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 88 changed coefficients
0.07/0.08 c 3108 implications, 0 cliques
0.07/0.08 c presolved problem has 246 variables (246 bin, 0 int, 0 impl, 0 cont) and 163 constraints
0.07/0.08 c 150 constraints of type <and>
0.07/0.08 c 6 constraints of type <linear>
0.07/0.08 c 7 constraints of type <logicor>
0.07/0.08 c transformed objective value is always integral (scale: 2)
0.07/0.08 c Presolving Time: 0.04
0.07/0.08 c - non default parameters ----------------------------------------------------------------------
0.07/0.08 c # SCIP version 1.2.1.2
0.07/0.08 c
0.07/0.08 c # frequency for displaying node information lines
0.07/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.07/0.08 c display/freq = 10000
0.07/0.08 c
0.07/0.08 c # maximal time in seconds to run
0.07/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.08 c limits/time = 1799.99
0.07/0.08 c
0.07/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.07/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.08 c limits/memory = 1620
0.07/0.08 c
0.07/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.07/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.07/0.08 c lp/solvefreq = -1
0.07/0.08 c
0.07/0.08 c # should presolving try to simplify inequalities
0.07/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.08 c constraints/linear/simplifyinequalities = TRUE
0.07/0.08 c
0.07/0.08 c # should presolving try to simplify knapsacks
0.07/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.07/0.08 c
0.07/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.07/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.08 c heuristics/undercover/freq = 0
0.07/0.08 c
0.07/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.07/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.08 c separating/rapidlearning/freq = 0
0.07/0.08 c
0.07/0.08 c -----------------------------------------------------------------------------------------------
0.07/0.08 c start solving
0.07/0.08 c
0.07/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.07/0.08 c 0.0s| 1 | 2 | 0 | - | 883k| 0 | - | 246 | 163 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.68/1.74 o 57
1.68/1.74 c * 1.5s| 9599 | 7210 | 0 | 0.0 |5543k| 94 | - | 246 | 422 | 0 | 0 | 0 |1193 | 0 | 1.000000e+00 | 5.700000e+01 |5600.00%
1.79/1.82 c 1.5s| 10000 | 7495 | 0 | 0.0 |5762k| 94 | - | 246 | 458 | 0 | 0 | 0 |1277 | 0 | 1.000000e+00 | 5.700000e+01 |5600.00%
3.79/3.82 c 3.3s| 20000 | 14233 | 0 | 0.0 | 10M| 94 | - | 246 | 820 | 0 | 0 | 0 |3310 | 0 | 1.000000e+00 | 5.700000e+01 |5600.00%
4.69/4.71 o 9
4.69/4.71 c * 4.1s| 24214 | 8457 | 0 | 0.0 |7191k| 94 | - | 246 | 865 | 0 | 0 | 0 |4154 | 0 | 1.000000e+00 | 9.000000e+00 | 800.00%
5.50/5.51 o 3
5.50/5.51 c * 4.8s| 27638 | 6184 | 0 | 0.0 |5854k| 94 | - | 246 | 599 | 0 | 0 | 0 |4968 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
5.50/5.56 c
5.50/5.56 c SCIP Status : problem is solved [optimal solution found]
5.50/5.56 c Solving Time (sec) : 4.81
5.50/5.56 c Solving Nodes : 27638
5.50/5.56 c Primal Bound : +3.00000000000000e+00 (3 solutions)
5.50/5.56 c Dual Bound : +3.00000000000000e+00
5.50/5.56 c Gap : 0.00 %
5.50/5.56 s OPTIMUM FOUND
5.50/5.56 v -x108 -x107 -x106 -x105 -x104 -x103 -x102 x101 x100 -x99 x98 -x97 -x72 -x71 -x70 -x69 -x68 x67 -x96 -x95 -x94 -x93 -x92 -x91 x66
5.50/5.56 v -x65 x64 x63 -x62 x61 -x90 -x89 -x88 -x87 -x86 -x85 -x60 -x59 x58 -x57 -x56 x55 -x84 -x83 -x82 x81 x80 -x79 -x54 -x53 -x52
5.50/5.56 v -x51 -x50 x49 -x78 -x77 -x76 -x75 -x74 x73 -x48 -x47 x46 -x45 x44 x43 x42 x41 -x40 -x39 x38 x37 x36 -x35 -x34 x33 -x32 x31 -x30
5.50/5.56 v -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 -x4 -x3 x2 x1
5.50/5.56 c SCIP Status : problem is solved [optimal solution found]
5.50/5.56 c Solving Time : 4.81
5.50/5.56 c Original Problem :
5.50/5.56 c Problem name : HOME/instance-2663570-1276647459.opb
5.50/5.56 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
5.50/5.56 c Constraints : 229 initial, 229 maximal
5.50/5.56 c Presolved Problem :
5.50/5.56 c Problem name : t_HOME/instance-2663570-1276647459.opb
5.50/5.56 c Variables : 246 (246 binary, 0 integer, 0 implicit integer, 0 continuous)
5.50/5.56 c Constraints : 163 initial, 902 maximal
5.50/5.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.50/5.56 c trivial : 0.00 0 0 0 0 0 0 0 0
5.50/5.56 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.50/5.56 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.50/5.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.50/5.56 c implics : 0.00 0 0 0 0 0 0 0 0
5.50/5.56 c probing : 0.01 0 0 0 0 0 0 0 0
5.50/5.56 c and : 0.01 12 60 0 0 0 60 0 60
5.50/5.56 c linear : 0.02 1 5 0 0 0 0 0 28
5.50/5.56 c logicor : 0.00 0 0 0 0 0 0 0 0
5.50/5.56 c root node : - 36 - - 36 - - - -
5.50/5.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.50/5.56 c integral : 0 0 0 0 0 0 0 0 0 0
5.50/5.56 c and : 150 0 66687 0 24716 714 95873 0 0 0
5.50/5.56 c linear : 6 0 65972 0 24716 3126 44448 0 0 0
5.50/5.56 c logicor : 7+ 0 32637 0 24715 383 10470 0 0 0
5.50/5.56 c countsols : 0 0 0 0 24719 0 0 0 0 0
5.50/5.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.50/5.56 c integral : 0.00 0.00 0.00 0.00 0.00
5.50/5.56 c and : 0.70 0.00 0.44 0.00 0.26
5.50/5.56 c linear : 1.08 0.00 1.05 0.00 0.03
5.50/5.56 c logicor : 0.36 0.00 0.32 0.00 0.04
5.50/5.56 c countsols : 0.00 0.00 0.00 0.00 0.00
5.50/5.56 c Propagators : Time Calls Cutoffs DomReds
5.50/5.56 c vbounds : 0.04 2 0 0
5.50/5.56 c rootredcost : 0.02 0 0 0
5.50/5.56 c pseudoobj : 0.09 66390 20 280
5.50/5.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.50/5.56 c propagation : 0.31 4243 4173 29749 28.9 293 29.0 -
5.50/5.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.50/5.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.50/5.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.50/5.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.50/5.56 c applied globally : - - - 4904 14.9 - - -
5.50/5.56 c applied locally : - - - 65 35.5 - - -
5.50/5.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.50/5.56 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.50/5.56 c redcost : 0.00 0 0 0 0 0
5.50/5.56 c impliedbounds : 0.00 0 0 0 0 0
5.50/5.56 c intobj : 0.00 0 0 0 0 0
5.50/5.56 c cgmip : 0.00 0 0 0 0 0
5.50/5.56 c gomory : 0.00 0 0 0 0 0
5.50/5.56 c strongcg : 0.00 0 0 0 0 0
5.50/5.56 c cmir : 0.00 0 0 0 0 0
5.50/5.56 c flowcover : 0.00 0 0 0 0 0
5.50/5.56 c clique : 0.00 0 0 0 0 0
5.50/5.56 c zerohalf : 0.00 0 0 0 0 0
5.50/5.56 c mcf : 0.00 0 0 0 0 0
5.50/5.56 c rapidlearning : 0.00 0 0 0 0 0
5.50/5.56 c Pricers : Time Calls Vars
5.50/5.56 c problem variables: 0.00 0 0
5.50/5.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.50/5.56 c relpscost : 0.00 0 0 0 0 0 0
5.50/5.56 c pscost : 0.00 0 0 0 0 0 0
5.50/5.56 c inference : 0.69 24716 0 0 0 0 49432
5.50/5.56 c mostinf : 0.00 0 0 0 0 0 0
5.50/5.56 c leastinf : 0.00 0 0 0 0 0 0
5.50/5.56 c fullstrong : 0.00 0 0 0 0 0 0
5.50/5.56 c allfullstrong : 0.00 0 0 0 0 0 0
5.50/5.56 c random : 0.00 0 0 0 0 0 0
5.50/5.56 c Primal Heuristics : Time Calls Found
5.50/5.56 c LP solutions : 0.00 - 0
5.50/5.56 c pseudo solutions : 0.04 - 3
5.50/5.56 c oneopt : 0.00 0 0
5.50/5.56 c trivial : 0.00 2 0
5.50/5.56 c simplerounding : 0.00 0 0
5.50/5.56 c zirounding : 0.00 0 0
5.50/5.56 c rounding : 0.00 0 0
5.50/5.56 c shifting : 0.00 0 0
5.50/5.56 c intshifting : 0.00 0 0
5.50/5.56 c twoopt : 0.00 0 0
5.50/5.56 c fixandinfer : 0.00 0 0
5.50/5.56 c feaspump : 0.00 0 0
5.50/5.56 c coefdiving : 0.00 0 0
5.50/5.56 c pscostdiving : 0.00 0 0
5.50/5.56 c fracdiving : 0.00 0 0
5.50/5.56 c veclendiving : 0.00 0 0
5.50/5.56 c intdiving : 0.00 0 0
5.50/5.56 c actconsdiving : 0.00 0 0
5.50/5.56 c objpscostdiving : 0.00 0 0
5.50/5.56 c rootsoldiving : 0.00 0 0
5.50/5.56 c linesearchdiving : 0.00 0 0
5.50/5.56 c guideddiving : 0.00 0 0
5.50/5.56 c octane : 0.00 0 0
5.50/5.56 c rens : 0.00 0 0
5.50/5.56 c rins : 0.00 0 0
5.50/5.56 c localbranching : 0.00 0 0
5.50/5.56 c mutation : 0.00 0 0
5.50/5.56 c crossover : 0.00 0 0
5.50/5.56 c dins : 0.00 0 0
5.50/5.56 c undercover : 0.00 0 0
5.50/5.56 c nlp : 0.02 0 0
5.50/5.56 c trysol : 0.02 0 0
5.50/5.56 c LP : Time Calls Iterations Iter/call Iter/sec
5.50/5.56 c primal LP : 0.00 0 0 0.00 -
5.50/5.56 c dual LP : 0.00 0 0 0.00 -
5.50/5.56 c lex dual LP : 0.00 0 0 0.00 -
5.50/5.56 c barrier LP : 0.00 0 0 0.00 -
5.50/5.56 c diving/probing LP: 0.00 0 0 0.00 -
5.50/5.56 c strong branching : 0.00 0 0 0.00 -
5.50/5.56 c (at root node) : - 0 0 0.00 -
5.50/5.56 c conflict analysis: 0.00 0 0 0.00 -
5.50/5.56 c B&B Tree :
5.50/5.56 c number of runs : 1
5.50/5.56 c nodes : 27638
5.50/5.56 c nodes (total) : 27638
5.50/5.56 c nodes left : 0
5.50/5.56 c max depth : 94
5.50/5.56 c max depth (total): 94
5.50/5.56 c backtracks : 2594 (9.4%)
5.50/5.56 c delayed cutoffs : 8120
5.50/5.56 c repropagations : 4937 (16485 domain reductions, 1324 cutoffs)
5.50/5.56 c avg switch length: 4.12
5.50/5.56 c switching time : 0.78
5.50/5.56 c Solution :
5.50/5.56 c Solutions found : 3 (3 improvements)
5.50/5.56 c First Solution : +5.70000000000000e+01 (in run 1, after 9599 nodes, 1.47 seconds, depth 81, found by <relaxation>)
5.50/5.56 c Primal Bound : +3.00000000000000e+00 (in run 1, after 27638 nodes, 4.77 seconds, depth 66, found by <relaxation>)
5.50/5.56 c Dual Bound : +3.00000000000000e+00
5.50/5.56 c Gap : 0.00 %
5.50/5.56 c Root Dual Bound : +1.00000000000000e+00
5.50/5.56 c Root Iterations : 0
5.50/5.57 c Time complete: 5.56.