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-2664765-1276592032.opb>
0.00/0.01 c original problem has 96 variables (96 bin, 0 int, 0 impl, 0 cont) and 28 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 o 96
0.00/0.01 c feasible solution found by trivial heuristic, objective value 9.600000e+01
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.01/0.02 c (round 2) 0 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 23 upgd conss, 2 impls, 0 clqs
0.01/0.02 c presolving (3 rounds):
0.01/0.02 c 0 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 0 changed coefficients
0.01/0.02 c 2 implications, 0 cliques
0.01/0.02 c presolved problem has 96 variables (96 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.01/0.02 c 23 constraints of type <logicor>
0.01/0.02 c transformed objective value is always integral (scale: 1)
0.01/0.02 c Presolving Time: 0.00
0.01/0.02 c - non default parameters ----------------------------------------------------------------------
0.01/0.02 c # SCIP version 1.2.1.2
0.01/0.02 c
0.01/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.02 c conflict/interconss = 0
0.01/0.02 c
0.01/0.02 c # should binary conflicts be preferred?
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c conflict/preferbinary = TRUE
0.01/0.02 c
0.01/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.02 c constraints/agelimit = 1
0.01/0.02 c
0.01/0.02 c # should enforcement of pseudo solution be disabled?
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/disableenfops = TRUE
0.01/0.02 c
0.01/0.02 c # frequency for displaying node information lines
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.02 c display/freq = 10000
0.01/0.02 c
0.01/0.02 c # maximal time in seconds to run
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.02 c limits/time = 1800
0.01/0.02 c
0.01/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.02 c limits/memory = 1620
0.01/0.02 c
0.01/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c lp/solvefreq = -1
0.01/0.02 c
0.01/0.02 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.01/0.02 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.02 c lp/pricing = a
0.01/0.02 c
0.01/0.02 c # should presolving try to simplify inequalities
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/linear/simplifyinequalities = TRUE
0.01/0.02 c
0.01/0.02 c # should presolving try to simplify knapsacks
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.02 c
0.01/0.02 c # priority of node selection rule <dfs> in standard mode
0.01/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.02 c nodeselection/dfs/stdpriority = 1000000
0.01/0.02 c
0.01/0.02 c -----------------------------------------------------------------------------------------------
0.01/0.02 c start solving
0.01/0.02 c
0.01/0.02 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.02 c t 0.0s| 1 | 2 | 0 | - | 373k| 0 | - | 96 | 23 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 9.600000e+01 | Inf
0.01/0.03 o 5
0.01/0.03 c * 0.0s| 92 | 91 | 0 | 0.0 | 397k| 91 | - | 96 | 23 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
0.01/0.03 o 4
0.01/0.03 c * 0.0s| 107 | 89 | 0 | 0.0 | 400k| 92 | - | 96 | 23 | 0 | 0 | 0 | 9 | 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
1.49/1.56 c 1.3s| 10000 | 44 | 0 | 0.0 | 468k| 92 | - | 96 | 29 | 0 | 0 | 0 |5319 | 0 | 2.000000e+00 | 4.000000e+00 | 100.00%
1.79/1.86 c
1.79/1.86 c SCIP Status : problem is solved [optimal solution found]
1.79/1.86 c Solving Time (sec) : 1.59
1.79/1.86 c Solving Nodes : 12040
1.79/1.86 c Primal Bound : +4.00000000000000e+00 (5 solutions)
1.79/1.86 c Dual Bound : +4.00000000000000e+00
1.79/1.86 c Gap : 0.00 %
1.79/1.86 s OPTIMUM FOUND
1.79/1.86 v x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71
1.79/1.86 v -x70 x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46
1.79/1.86 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
1.79/1.86 v -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.79/1.86 c SCIP Status : problem is solved [optimal solution found]
1.79/1.86 c Solving Time : 1.59
1.79/1.86 c Original Problem :
1.79/1.86 c Problem name : HOME/instance-2664765-1276592032.opb
1.79/1.86 c Variables : 96 (96 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.86 c Constraints : 28 initial, 28 maximal
1.79/1.86 c Presolved Problem :
1.79/1.86 c Problem name : t_HOME/instance-2664765-1276592032.opb
1.79/1.86 c Variables : 96 (96 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.86 c Constraints : 23 initial, 42 maximal
1.79/1.86 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.79/1.86 c trivial : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c implics : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c probing : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c linear : 0.00 0 0 0 0 0 5 5 0
1.79/1.86 c logicor : 0.00 0 0 0 0 0 0 0 0
1.79/1.86 c root node : - 96 - - 96 - - - -
1.79/1.86 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.79/1.86 c integral : 0 0 0 0 0 0 0 0 0 0
1.79/1.86 c logicor : 23+ 0 14481 0 2 6393 4877 0 0 0
1.79/1.86 c countsols : 0 0 0 0 2 0 0 0 0 0
1.79/1.86 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.79/1.86 c integral : 0.00 0.00 0.00 0.00 0.00
1.79/1.86 c logicor : 0.43 0.00 0.43 0.00 0.00
1.79/1.86 c countsols : 0.00 0.00 0.00 0.00 0.00
1.79/1.86 c Propagators : Time Calls Cutoffs DomReds
1.79/1.86 c vbounds : 0.04 2 0 0
1.79/1.86 c rootredcost : 0.01 0 0 0
1.79/1.86 c pseudoobj : 0.41 38628 9 230218
1.79/1.86 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.86 c propagation : 0.35 6402 6399 6399 33.5 0 0.0 -
1.79/1.86 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.86 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.86 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.86 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.86 c applied globally : - - - 2286 19.6 - - -
1.79/1.86 c applied locally : - - - 4113 41.2 - - -
1.79/1.86 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.86 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.79/1.86 c redcost : 0.00 0 0 0 0 0
1.79/1.86 c impliedbounds : 0.00 0 0 0 0 0
1.79/1.86 c intobj : 0.00 0 0 0 0 0
1.79/1.86 c cgmip : 0.00 0 0 0 0 0
1.79/1.86 c gomory : 0.00 0 0 0 0 0
1.79/1.86 c strongcg : 0.00 0 0 0 0 0
1.79/1.86 c cmir : 0.00 0 0 0 0 0
1.79/1.86 c flowcover : 0.00 0 0 0 0 0
1.79/1.86 c clique : 0.00 0 0 0 0 0
1.79/1.86 c zerohalf : 0.00 0 0 0 0 0
1.79/1.86 c mcf : 0.00 0 0 0 0 0
1.79/1.86 c rapidlearning : 0.00 0 0 0 0 0
1.79/1.86 c Pricers : Time Calls Vars
1.79/1.86 c problem variables: 0.00 0 0
1.79/1.86 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.86 c relpscost : 0.00 0 0 0 0 0 0
1.79/1.86 c pscost : 0.00 0 0 0 0 0 0
1.79/1.86 c inference : 0.07 6824 0 0 0 0 13648
1.79/1.86 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.86 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.86 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.86 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.86 c random : 0.00 0 0 0 0 0 0
1.79/1.86 c Primal Heuristics : Time Calls Found
1.79/1.86 c LP solutions : 0.00 - 0
1.79/1.86 c pseudo solutions : 0.00 - 2
1.79/1.86 c oneopt : 0.00 0 0
1.79/1.86 c trivial : 0.00 2 3
1.79/1.86 c simplerounding : 0.00 0 0
1.79/1.86 c zirounding : 0.00 0 0
1.79/1.86 c rounding : 0.00 0 0
1.79/1.86 c shifting : 0.00 0 0
1.79/1.86 c intshifting : 0.00 0 0
1.79/1.86 c twoopt : 0.00 0 0
1.79/1.86 c fixandinfer : 0.00 0 0
1.79/1.86 c feaspump : 0.00 0 0
1.79/1.86 c coefdiving : 0.00 0 0
1.79/1.86 c pscostdiving : 0.00 0 0
1.79/1.86 c fracdiving : 0.00 0 0
1.79/1.86 c veclendiving : 0.00 0 0
1.79/1.86 c intdiving : 0.00 0 0
1.79/1.86 c actconsdiving : 0.00 0 0
1.79/1.86 c objpscostdiving : 0.00 0 0
1.79/1.86 c rootsoldiving : 0.00 0 0
1.79/1.86 c linesearchdiving : 0.00 0 0
1.79/1.86 c guideddiving : 0.00 0 0
1.79/1.86 c octane : 0.00 0 0
1.79/1.86 c rens : 0.00 0 0
1.79/1.86 c rins : 0.00 0 0
1.79/1.86 c localbranching : 0.00 0 0
1.79/1.86 c mutation : 0.00 0 0
1.79/1.86 c crossover : 0.00 0 0
1.79/1.86 c dins : 0.00 0 0
1.79/1.86 c undercover : 0.00 0 0
1.79/1.86 c nlp : 0.01 0 0
1.79/1.86 c trysol : 0.02 0 0
1.79/1.86 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.86 c primal LP : 0.00 0 0 0.00 -
1.79/1.86 c dual LP : 0.00 0 0 0.00 -
1.79/1.86 c lex dual LP : 0.00 0 0 0.00 -
1.79/1.86 c barrier LP : 0.00 0 0 0.00 -
1.79/1.86 c diving/probing LP: 0.00 0 0 0.00 -
1.79/1.86 c strong branching : 0.00 0 0 0.00 -
1.79/1.86 c (at root node) : - 0 0 0.00 -
1.79/1.86 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.86 c B&B Tree :
1.79/1.86 c number of runs : 1
1.79/1.86 c nodes : 12040
1.79/1.86 c nodes (total) : 12040
1.79/1.86 c nodes left : 0
1.79/1.86 c max depth : 92
1.79/1.86 c max depth (total): 92
1.79/1.86 c backtracks : 6227 (51.7%)
1.79/1.86 c delayed cutoffs : 1608
1.79/1.86 c repropagations : 21855 (25230 domain reductions, 1188 cutoffs)
1.79/1.86 c avg switch length: 5.01
1.79/1.86 c switching time : 0.28
1.79/1.86 c Solution :
1.79/1.86 c Solutions found : 5 (3 improvements)
1.79/1.86 c First Solution : +9.60000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.79/1.86 c Primal Bound : +4.00000000000000e+00 (in run 1, after 107 nodes, 0.02 seconds, depth 91, found by <relaxation>)
1.79/1.86 c Dual Bound : +4.00000000000000e+00
1.79/1.86 c Gap : 0.00 %
1.79/1.86 c Root Dual Bound : +0.00000000000000e+00
1.79/1.86 c Root Iterations : 0
1.79/1.87 c Time complete: 1.86.