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-2663534-1276646556.opb>
0.00/0.01 c original problem has 320 variables (320 bin, 0 int, 0 impl, 0 cont) and 217 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) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 0 upgd conss, 1476 impls, 0 clqs
0.00/0.04 c (round 2) 22 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 0 upgd conss, 2127 impls, 0 clqs
0.00/0.04 c (round 3) 32 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 9 upgd conss, 2607 impls, 0 clqs
0.00/0.04 c (round 4) 42 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 9 upgd conss, 3007 impls, 0 clqs
0.00/0.05 c (round 5) 52 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 9 upgd conss, 3327 impls, 0 clqs
0.00/0.05 c (round 6) 62 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 68 chg coeffs, 9 upgd conss, 3567 impls, 0 clqs
0.00/0.05 c (round 7) 72 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 9 upgd conss, 3727 impls, 0 clqs
0.00/0.06 c (round 8) 82 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 84 chg coeffs, 9 upgd conss, 3807 impls, 0 clqs
0.00/0.06 c (round 9) 92 del vars, 65 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 9 upgd conss, 3807 impls, 0 clqs
0.07/0.08 c (0.0s) probing: 161/228 (70.6%) - 0 fixings, 0 aggregations, 16 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 (10 rounds):
0.07/0.08 c 92 deleted vars, 65 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 92 changed coefficients
0.07/0.08 c 3839 implications, 0 cliques
0.07/0.08 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.07/0.08 c 126 constraints of type <and>
0.07/0.08 c 8 constraints of type <linear>
0.07/0.08 c 10 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 = 1800
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 | - | 872k| 0 | - | 228 | 144 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.00/1.05 o 5
1.00/1.05 c * 0.9s| 5886 | 4146 | 0 | 0.0 |3909k| 80 | - | 228 | 836 | 0 | 0 | 0 |1464 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.00/1.10 o 3
1.00/1.10 c * 0.9s| 6094 | 4068 | 0 | 0.0 |3897k| 80 | - | 228 | 778 | 0 | 0 | 0 |1502 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.09/1.13 c
1.09/1.13 c SCIP Status : problem is solved [optimal solution found]
1.09/1.13 c Solving Time (sec) : 0.95
1.09/1.13 c Solving Nodes : 6094
1.09/1.13 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.09/1.13 c Dual Bound : +3.00000000000000e+00
1.09/1.13 c Gap : 0.00 %
1.09/1.13 s OPTIMUM FOUND
1.09/1.13 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x80 -x79 -x78 -x77 x76 -x110 -x109 -x108 x107 -x106 -x75 x74 -x73 x72
1.09/1.13 v x71 -x105 -x104 -x103 -x102 -x101 -x70 x69 x68 x67 x66 -x100 -x99 -x98 -x97 -x96 -x65 -x64 x63 -x62 x61 -x95 -x94 -x93 -x92
1.09/1.13 v x91 -x60 -x59 -x58 -x57 x56 -x90 -x89 -x88 -x87 -x86 -x55 -x54 -x53 x52 x51 -x85 -x84 -x83 -x82 x81 -x50 -x49 -x48 -x47 x46
1.09/1.13 v x45 x44 x43 -x42 x41 -x40 -x39 -x38 x37 x36 -x35 -x34 x33 -x32 x31 -x30 -x29 -x28 x27 x26 -x25 -x24 x23 -x22 x21 -x20 x19 -x18
1.09/1.13 v x17 x16 -x15 -x14 -x13 x12 x11 -x10 x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
1.09/1.13 c SCIP Status : problem is solved [optimal solution found]
1.09/1.13 c Solving Time : 0.95
1.09/1.13 c Original Problem :
1.09/1.13 c Problem name : HOME/instance-2663534-1276646556.opb
1.09/1.13 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.13 c Constraints : 217 initial, 217 maximal
1.09/1.13 c Presolved Problem :
1.09/1.13 c Problem name : t_HOME/instance-2663534-1276646556.opb
1.09/1.13 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.13 c Constraints : 144 initial, 845 maximal
1.09/1.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.09/1.13 c trivial : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c implics : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c probing : 0.01 0 0 0 0 0 0 0 0
1.09/1.13 c and : 0.00 16 65 0 0 0 65 0 65
1.09/1.13 c linear : 0.02 2 9 0 0 0 0 0 27
1.09/1.13 c logicor : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c root node : - 19 - - 19 - - - -
1.09/1.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.09/1.13 c integral : 0 0 0 0 0 0 0 0 0 0
1.09/1.13 c and : 126 0 15686 0 5427 171 18644 0 0 0
1.09/1.13 c linear : 8 0 15513 0 5427 745 10468 0 0 0
1.09/1.13 c logicor : 10+ 0 7340 0 5426 71 2297 0 0 0
1.09/1.13 c countsols : 0 0 0 0 5429 0 0 0 0 0
1.09/1.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.09/1.13 c integral : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c and : 0.15 0.00 0.08 0.00 0.07
1.09/1.13 c linear : 0.19 0.00 0.19 0.00 0.00
1.09/1.13 c logicor : 0.07 0.00 0.06 0.00 0.01
1.09/1.13 c countsols : 0.01 0.00 0.00 0.00 0.01
1.09/1.13 c Propagators : Time Calls Cutoffs DomReds
1.09/1.13 c vbounds : 0.03 2 0 0
1.09/1.13 c rootredcost : 0.00 0 0 0
1.09/1.13 c pseudoobj : 0.03 15433 83 72
1.09/1.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.09/1.13 c propagation : 0.07 1070 983 5689 22.4 66 16.2 -
1.09/1.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.13 c applied globally : - - - 1492 15.4 - - -
1.09/1.13 c applied locally : - - - 10 33.3 - - -
1.09/1.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.09/1.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.09/1.13 c redcost : 0.00 0 0 0 0 0
1.09/1.13 c impliedbounds : 0.00 0 0 0 0 0
1.09/1.13 c intobj : 0.00 0 0 0 0 0
1.09/1.13 c cgmip : 0.00 0 0 0 0 0
1.09/1.13 c gomory : 0.00 0 0 0 0 0
1.09/1.13 c strongcg : 0.00 0 0 0 0 0
1.09/1.13 c cmir : 0.00 0 0 0 0 0
1.09/1.13 c flowcover : 0.00 0 0 0 0 0
1.09/1.13 c clique : 0.00 0 0 0 0 0
1.09/1.13 c zerohalf : 0.00 0 0 0 0 0
1.09/1.13 c mcf : 0.00 0 0 0 0 0
1.09/1.13 c rapidlearning : 0.00 0 0 0 0 0
1.09/1.13 c Pricers : Time Calls Vars
1.09/1.13 c problem variables: 0.00 0 0
1.09/1.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.09/1.13 c relpscost : 0.00 0 0 0 0 0 0
1.09/1.13 c pscost : 0.00 0 0 0 0 0 0
1.09/1.13 c inference : 0.12 5427 0 0 0 0 10854
1.09/1.13 c mostinf : 0.00 0 0 0 0 0 0
1.09/1.13 c leastinf : 0.00 0 0 0 0 0 0
1.09/1.13 c fullstrong : 0.00 0 0 0 0 0 0
1.09/1.13 c allfullstrong : 0.00 0 0 0 0 0 0
1.09/1.13 c random : 0.00 0 0 0 0 0 0
1.09/1.13 c Primal Heuristics : Time Calls Found
1.09/1.13 c LP solutions : 0.00 - 0
1.09/1.13 c pseudo solutions : 0.00 - 2
1.09/1.13 c oneopt : 0.00 0 0
1.09/1.13 c trivial : 0.01 2 0
1.09/1.13 c simplerounding : 0.00 0 0
1.09/1.13 c zirounding : 0.00 0 0
1.09/1.13 c rounding : 0.00 0 0
1.09/1.13 c shifting : 0.00 0 0
1.09/1.13 c intshifting : 0.00 0 0
1.09/1.13 c twoopt : 0.00 0 0
1.09/1.13 c fixandinfer : 0.00 0 0
1.09/1.13 c feaspump : 0.00 0 0
1.09/1.13 c coefdiving : 0.00 0 0
1.09/1.13 c pscostdiving : 0.00 0 0
1.09/1.13 c fracdiving : 0.00 0 0
1.09/1.13 c veclendiving : 0.00 0 0
1.09/1.13 c intdiving : 0.00 0 0
1.09/1.13 c actconsdiving : 0.00 0 0
1.09/1.13 c objpscostdiving : 0.00 0 0
1.09/1.13 c rootsoldiving : 0.00 0 0
1.09/1.13 c linesearchdiving : 0.00 0 0
1.09/1.13 c guideddiving : 0.00 0 0
1.09/1.13 c octane : 0.00 0 0
1.09/1.13 c rens : 0.00 0 0
1.09/1.13 c rins : 0.00 0 0
1.09/1.13 c localbranching : 0.00 0 0
1.09/1.13 c mutation : 0.00 0 0
1.09/1.13 c crossover : 0.00 0 0
1.09/1.13 c dins : 0.00 0 0
1.09/1.13 c undercover : 0.00 0 0
1.09/1.13 c nlp : 0.00 0 0
1.09/1.13 c trysol : 0.00 0 0
1.09/1.13 c LP : Time Calls Iterations Iter/call Iter/sec
1.09/1.13 c primal LP : 0.00 0 0 0.00 -
1.09/1.13 c dual LP : 0.00 0 0 0.00 -
1.09/1.13 c lex dual LP : 0.00 0 0 0.00 -
1.09/1.13 c barrier LP : 0.00 0 0 0.00 -
1.09/1.13 c diving/probing LP: 0.00 0 0 0.00 -
1.09/1.13 c strong branching : 0.00 0 0 0.00 -
1.09/1.13 c (at root node) : - 0 0 0.00 -
1.09/1.13 c conflict analysis: 0.00 0 0 0.00 -
1.09/1.13 c B&B Tree :
1.09/1.13 c number of runs : 1
1.09/1.13 c nodes : 6094
1.09/1.13 c nodes (total) : 6094
1.09/1.13 c nodes left : 0
1.09/1.13 c max depth : 80
1.09/1.13 c max depth (total): 80
1.09/1.13 c backtracks : 578 (9.5%)
1.09/1.13 c delayed cutoffs : 4452
1.09/1.13 c repropagations : 1820 (4016 domain reductions, 405 cutoffs)
1.09/1.13 c avg switch length: 4.28
1.09/1.13 c switching time : 0.14
1.09/1.13 c Solution :
1.09/1.13 c Solutions found : 2 (2 improvements)
1.09/1.13 c First Solution : +5.00000000000000e+00 (in run 1, after 5886 nodes, 0.89 seconds, depth 68, found by <relaxation>)
1.09/1.13 c Primal Bound : +3.00000000000000e+00 (in run 1, after 6094 nodes, 0.93 seconds, depth 57, found by <relaxation>)
1.09/1.13 c Dual Bound : +3.00000000000000e+00
1.09/1.13 c Gap : 0.00 %
1.09/1.13 c Root Dual Bound : +1.00000000000000e+00
1.09/1.13 c Root Iterations : 0
1.09/1.14 c Time complete: 1.13.