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-2663632-1276648609.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.01/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.01/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.01/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.01/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.01/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.01/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.01/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.01/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.01/0.09 c (0.1s) probing: 167/287 (58.2%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.01/0.09 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.01/0.09 c presolving (9 rounds):
0.01/0.09 c 91 deleted vars, 70 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 102 changed coefficients
0.01/0.09 c 4144 implications, 0 cliques
0.01/0.09 c presolved problem has 287 variables (287 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.01/0.09 c 175 constraints of type <and>
0.01/0.09 c 7 constraints of type <linear>
0.01/0.09 c 8 constraints of type <logicor>
0.01/0.09 c transformed objective value is always integral (scale: 2)
0.01/0.09 c Presolving Time: 0.05
0.01/0.09 c - non default parameters ----------------------------------------------------------------------
0.01/0.09 c # SCIP version 1.2.1.2
0.01/0.09 c
0.01/0.09 c # frequency for displaying node information lines
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.09 c display/freq = 10000
0.01/0.09 c
0.01/0.09 c # maximal time in seconds to run
0.01/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.09 c limits/time = 1799.99
0.01/0.09 c
0.01/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.09 c limits/memory = 1620
0.01/0.09 c
0.01/0.09 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09 c lp/solvefreq = -1
0.01/0.09 c
0.01/0.09 c # should presolving try to simplify inequalities
0.01/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.09 c constraints/linear/simplifyinequalities = TRUE
0.01/0.09 c
0.01/0.09 c # should presolving try to simplify knapsacks
0.01/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.09 c
0.01/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.09 c heuristics/undercover/freq = 0
0.01/0.09 c
0.01/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.09 c separating/rapidlearning/freq = 0
0.01/0.09 c
0.01/0.09 c -----------------------------------------------------------------------------------------------
0.01/0.09 c start solving
0.01/0.09 c
0.01/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.01/0.09 c 0.1s| 1 | 2 | 0 | - |1017k| 0 | - | 287 | 190 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.79/1.88 c 1.6s| 10000 | 8052 | 0 | 0.0 |6186k| 128 | - | 287 | 632 | 0 | 0 | 0 |1350 | 0 | 1.000000e+00 | -- | Inf
1.99/2.02 o 33
1.99/2.02 c * 1.7s| 10748 | 8290 | 0 | 0.0 |6427k| 128 | - | 287 | 663 | 0 | 0 | 0 |1464 | 0 | 1.000000e+00 | 3.300000e+01 |3200.00%
2.29/2.32 o 25
2.29/2.32 c * 2.0s| 12303 | 9291 | 0 | 0.0 |7177k| 128 | - | 287 | 676 | 0 | 0 | 0 |1703 | 0 | 1.000000e+00 | 2.500000e+01 |2400.00%
2.49/2.57 o 5
2.49/2.57 c * 2.2s| 13352 | 7796 | 0 | 0.0 |6623k| 128 | - | 287 | 736 | 0 | 0 | 0 |2009 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
3.79/3.88 c 3.4s| 20000 | 11940 | 0 | 0.0 |9831k| 128 | - | 287 | 435 | 0 | 0 | 0 |2990 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
5.99/6.04 c 5.2s| 30000 | 16056 | 0 | 0.0 | 13M| 128 | - | 287 | 892 | 0 | 0 | 0 |4832 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
5.99/6.09 o 3
5.99/6.09 c * 5.3s| 30085 | 1811 | 0 | 0.0 |4416k| 128 | - | 287 | 910 | 0 | 0 | 0 |4858 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
6.10/6.11 c
6.10/6.11 c SCIP Status : problem is solved [optimal solution found]
6.10/6.11 c Solving Time (sec) : 5.31
6.10/6.11 c Solving Nodes : 30086
6.10/6.11 c Primal Bound : +3.00000000000000e+00 (4 solutions)
6.10/6.11 c Dual Bound : +3.00000000000000e+00
6.10/6.11 c Gap : 0.00 %
6.10/6.11 s OPTIMUM FOUND
6.10/6.11 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 -x84 -x83 -x82 -x81 -x80 x79 -x114 -x113 -x112 -x111 -x110
6.10/6.11 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
6.10/6.11 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
6.10/6.11 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 x25
6.10/6.11 v x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 x16 -x15 -x14 x13 -x12 x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 x2 x1
6.10/6.11 c SCIP Status : problem is solved [optimal solution found]
6.10/6.11 c Solving Time : 5.31
6.10/6.11 c Original Problem :
6.10/6.11 c Problem name : HOME/instance-2663632-1276648609.opb
6.10/6.11 c Variables : 378 (378 binary, 0 integer, 0 implicit integer, 0 continuous)
6.10/6.11 c Constraints : 267 initial, 267 maximal
6.10/6.11 c Presolved Problem :
6.10/6.11 c Problem name : t_HOME/instance-2663632-1276648609.opb
6.10/6.11 c Variables : 287 (287 binary, 0 integer, 0 implicit integer, 0 continuous)
6.10/6.11 c Constraints : 190 initial, 910 maximal
6.10/6.11 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.10/6.11 c trivial : 0.00 0 0 0 0 0 0 0 0
6.10/6.11 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.10/6.11 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.10/6.11 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.10/6.11 c implics : 0.00 0 0 0 0 0 0 0 0
6.10/6.11 c probing : 0.02 0 0 0 0 0 0 0 0
6.10/6.11 c and : 0.02 14 70 0 0 0 70 0 70
6.10/6.11 c linear : 0.00 1 6 0 0 0 0 0 32
6.10/6.11 c logicor : 0.00 0 0 0 0 0 0 0 0
6.10/6.11 c root node : - 29 - - 29 - - - -
6.10/6.11 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.10/6.11 c integral : 0 0 0 0 0 0 0 0 0 0
6.10/6.11 c and : 175 0 75732 0 27258 573 104909 0 0 0
6.10/6.11 c linear : 7 0 75156 0 27258 3339 50419 0 0 0
6.10/6.11 c logicor : 8+ 0 31502 0 27258 291 10465 0 0 0
6.10/6.11 c countsols : 0 0 0 0 27262 0 0 0 0 0
6.10/6.11 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.10/6.11 c integral : 0.00 0.00 0.00 0.00 0.00
6.10/6.11 c and : 0.68 0.00 0.48 0.00 0.20
6.10/6.11 c linear : 1.26 0.00 1.25 0.00 0.01
6.10/6.11 c logicor : 0.29 0.00 0.23 0.00 0.06
6.10/6.11 c countsols : 0.02 0.00 0.00 0.00 0.02
6.10/6.11 c Propagators : Time Calls Cutoffs DomReds
6.10/6.11 c vbounds : 0.01 2 0 0
6.10/6.11 c rootredcost : 0.02 0 0 0
6.10/6.11 c pseudoobj : 0.13 75412 24 373
6.10/6.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.10/6.11 c propagation : 0.39 4227 4201 30093 34.5 222 30.1 -
6.10/6.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.10/6.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.10/6.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.10/6.11 c pseudo solution : 0.00 1 1 1 0.0 0 0.0 -
6.10/6.11 c applied globally : - - - 4047 18.8 - - -
6.10/6.11 c applied locally : - - - 811 36.7 - - -
6.10/6.11 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.10/6.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
6.10/6.11 c redcost : 0.00 0 0 0 0 0
6.10/6.11 c impliedbounds : 0.00 0 0 0 0 0
6.10/6.11 c intobj : 0.00 0 0 0 0 0
6.10/6.11 c cgmip : 0.00 0 0 0 0 0
6.10/6.11 c gomory : 0.00 0 0 0 0 0
6.10/6.11 c strongcg : 0.00 0 0 0 0 0
6.10/6.11 c cmir : 0.00 0 0 0 0 0
6.10/6.11 c flowcover : 0.00 0 0 0 0 0
6.10/6.11 c clique : 0.00 0 0 0 0 0
6.10/6.11 c zerohalf : 0.00 0 0 0 0 0
6.10/6.11 c mcf : 0.00 0 0 0 0 0
6.10/6.11 c rapidlearning : 0.00 0 0 0 0 0
6.10/6.11 c Pricers : Time Calls Vars
6.10/6.11 c problem variables: 0.00 0 0
6.10/6.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.10/6.11 c relpscost : 0.00 0 0 0 0 0 0
6.10/6.11 c pscost : 0.00 0 0 0 0 0 0
6.10/6.11 c inference : 0.69 27258 0 0 0 0 54516
6.10/6.11 c mostinf : 0.00 0 0 0 0 0 0
6.10/6.11 c leastinf : 0.00 0 0 0 0 0 0
6.10/6.11 c fullstrong : 0.00 0 0 0 0 0 0
6.10/6.11 c allfullstrong : 0.00 0 0 0 0 0 0
6.10/6.11 c random : 0.00 0 0 0 0 0 0
6.10/6.11 c Primal Heuristics : Time Calls Found
6.10/6.11 c LP solutions : 0.00 - 0
6.10/6.11 c pseudo solutions : 0.03 - 4
6.10/6.11 c oneopt : 0.00 0 0
6.10/6.11 c trivial : 0.00 2 0
6.10/6.11 c simplerounding : 0.00 0 0
6.10/6.11 c zirounding : 0.00 0 0
6.10/6.11 c rounding : 0.00 0 0
6.10/6.11 c shifting : 0.00 0 0
6.10/6.11 c intshifting : 0.00 0 0
6.10/6.11 c twoopt : 0.00 0 0
6.10/6.11 c fixandinfer : 0.00 0 0
6.10/6.11 c feaspump : 0.00 0 0
6.10/6.11 c coefdiving : 0.00 0 0
6.10/6.11 c pscostdiving : 0.00 0 0
6.10/6.11 c fracdiving : 0.00 0 0
6.10/6.11 c veclendiving : 0.00 0 0
6.10/6.11 c intdiving : 0.00 0 0
6.10/6.11 c actconsdiving : 0.00 0 0
6.10/6.11 c objpscostdiving : 0.00 0 0
6.10/6.11 c rootsoldiving : 0.00 0 0
6.10/6.11 c linesearchdiving : 0.00 0 0
6.10/6.11 c guideddiving : 0.00 0 0
6.10/6.11 c octane : 0.00 0 0
6.10/6.11 c rens : 0.00 0 0
6.10/6.11 c rins : 0.00 0 0
6.10/6.11 c localbranching : 0.00 0 0
6.10/6.11 c mutation : 0.00 0 0
6.10/6.11 c crossover : 0.00 0 0
6.10/6.11 c dins : 0.00 0 0
6.10/6.11 c undercover : 0.00 0 0
6.10/6.11 c nlp : 0.02 0 0
6.10/6.11 c trysol : 0.02 0 0
6.10/6.11 c LP : Time Calls Iterations Iter/call Iter/sec
6.10/6.11 c primal LP : 0.00 0 0 0.00 -
6.10/6.11 c dual LP : 0.00 0 0 0.00 -
6.10/6.11 c lex dual LP : 0.00 0 0 0.00 -
6.10/6.11 c barrier LP : 0.00 0 0 0.00 -
6.10/6.11 c diving/probing LP: 0.00 0 0 0.00 -
6.10/6.11 c strong branching : 0.00 0 0 0.00 -
6.10/6.11 c (at root node) : - 0 0 0.00 -
6.10/6.11 c conflict analysis: 0.00 0 0 0.00 -
6.10/6.11 c B&B Tree :
6.10/6.11 c number of runs : 1
6.10/6.11 c nodes : 30086
6.10/6.11 c nodes (total) : 30086
6.10/6.11 c nodes left : 0
6.10/6.11 c max depth : 128
6.10/6.11 c max depth (total): 128
6.10/6.11 c backtracks : 2797 (9.3%)
6.10/6.11 c delayed cutoffs : 7621
6.10/6.11 c repropagations : 8505 (17783 domain reductions, 1404 cutoffs)
6.10/6.11 c avg switch length: 4.22
6.10/6.11 c switching time : 0.73
6.10/6.11 c Solution :
6.10/6.11 c Solutions found : 4 (4 improvements)
6.10/6.11 c First Solution : +3.30000000000000e+01 (in run 1, after 10748 nodes, 1.72 seconds, depth 83, found by <relaxation>)
6.10/6.11 c Primal Bound : +3.00000000000000e+00 (in run 1, after 30085 nodes, 5.26 seconds, depth 85, found by <relaxation>)
6.10/6.11 c Dual Bound : +3.00000000000000e+00
6.10/6.11 c Gap : 0.00 %
6.10/6.11 c Root Dual Bound : +1.00000000000000e+00
6.10/6.11 c Root Iterations : 0
6.10/6.12 c Time complete: 6.12.