0.29/0.37 c SCIP version 1.1.0.7
0.29/0.37 c LP-Solver Clp 1.8.2
0.29/0.37 c user parameter file <scip.set> not found - using default parameters
0.29/0.37 c read problem <HOME/instance-1884588-1245259578.opb>
0.29/0.37 c original problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 15120 constraints
0.39/0.46 c No objective function, only one solution is needed.
0.39/0.46 c start presolving problem
0.39/0.46 c presolving:
0.59/0.64 c (round 1) 0 del vars, 7560 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.69/0.72 c presolving (2 rounds):
0.69/0.72 c 0 deleted vars, 7560 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.72 c 0 implications, 0 cliques
0.69/0.72 c presolved problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 7560 constraints
0.69/0.72 c 7560 constraints of type <linear>
0.69/0.72 c transformed objective value is always integral (scale: 1)
0.69/0.72 c Presolving Time: 0.23
0.69/0.72 c SATUNSAT-LIN
0.69/0.72 c -----------------------------------------------------------------------------------------------
0.69/0.72 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.72 c separating/flowcover/freq = c -1
0.69/0.72 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.72 c separating/cmir/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/veclendiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.69/0.72 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/veclendiving/freq = c -1
0.69/0.72 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.72 c heuristics/simplerounding/freq = c -1
0.69/0.72 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/shifting/freq = c -1
0.69/0.72 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.72 c heuristics/rounding/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.72 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.69/0.72 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.72 c heuristics/rootsoldiving/freq = c -1
0.69/0.72 c # number of nodes added to the contingent of the total nodes
0.69/0.72 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.72 c heuristics/rens/nodesofs = c 2000
0.69/0.72 c # minimum percentage of integer variables that have to be fixable
0.69/0.72 c # [type: real, range: [0,1], default: 0.5]
0.69/0.72 c heuristics/rens/minfixingrate = c 0.3
0.69/0.72 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.72 c heuristics/rens/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.69/0.72 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/pscostdiving/freq = c -1
0.69/0.72 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.72 c heuristics/oneopt/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.72 c # [type: real, range: [0,1], default: 0.01]
0.69/0.72 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.69/0.72 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.72 c heuristics/objpscostdiving/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.69/0.72 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/linesearchdiving/freq = c -1
0.69/0.72 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/intshifting/freq = c -1
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/intdiving/maxlpiterquot = c 0.075
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/guideddiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.69/0.72 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/guideddiving/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/fracdiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.69/0.72 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/fracdiving/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/feaspump/maxlpiterofs = c 2000
0.69/0.72 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.72 c heuristics/feaspump/freq = c -1
0.69/0.72 c # minimum percentage of integer variables that have to be fixed
0.69/0.72 c # [type: real, range: [0,1], default: 0.666]
0.69/0.72 c heuristics/crossover/minfixingrate = c 0.5
0.69/0.72 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.72 c # [type: real, range: [0,1], default: 0.1]
0.69/0.72 c heuristics/crossover/nodesquot = c 0.15
0.69/0.72 c # number of nodes without incumbent change that heuristic should wait
0.69/0.72 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.72 c heuristics/crossover/nwaitingnodes = c 100
0.69/0.72 c # number of nodes added to the contingent of the total nodes
0.69/0.72 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.72 c heuristics/crossover/nodesofs = c 750
0.69/0.72 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.72 c heuristics/crossover/freq = c -1
0.69/0.72 c # additional number of allowed LP iterations
0.69/0.72 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.72 c heuristics/coefdiving/maxlpiterofs = c 1500
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.72 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.69/0.72 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/coefdiving/freq = c -1
0.69/0.72 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c presolving/probing/maxrounds = c 0
0.69/0.72 c # should presolving try to simplify knapsacks
0.69/0.72 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.72 c constraints/knapsack/simplifyinequalities = c TRUE
0.69/0.72 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.72 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.72 c constraints/knapsack/disaggregation = c FALSE
0.69/0.72 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c constraints/knapsack/maxnumcardlift = c 0
0.69/0.72 c # should presolving try to simplify inequalities
0.69/0.72 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.72 c constraints/linear/simplifyinequalities = c TRUE
0.69/0.72 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c separating/maxroundsroot = c 5
0.69/0.72 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.72 c separating/maxrounds = c 1
0.69/0.72 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c limits/solutions = c 1
0.69/0.72 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.72 c limits/memory = c 1620
0.69/0.72 c # maximal time in seconds to run
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.72 c limits/time = c 1791
0.69/0.72 c # frequency for displaying node information lines
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.72 c display/freq = c 10000
0.69/0.72 c -----------------------------------------------------------------------------------------------
0.69/0.72 c start solving problem
0.69/0.72 c
0.89/0.91 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.91 c 0.5s| 1 | 0 | 44 | 24M| 0 | 36 | 36 |7560 |7560 | 36 |7560 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
12.88/12.91 c 12.4s| 1 | 2 | 44 | 24M| 0 | 36 | 36 |7560 |7560 | 36 |7560 | 0 | 0 | 33 | 3.000000e+00 | -- | Inf
43.67/43.79 c *43.0s| 13 | 11 | 464 | 24M| 12 | - | 36 |7560 |7560 | 36 |7560 | 0 | 0 | 179 | 3.111111e+00 | 1.300000e+01 | 317.86%
43.67/43.79 c
43.67/43.79 c SCIP Status : solving was interrupted [solution limit reached]
43.67/43.79 c Solving Time (sec) : 42.99
43.67/43.79 c Solving Nodes : 13
43.67/43.79 c Primal Bound : +1.30000000000000e+01 (1 solutions)
43.67/43.79 c Dual Bound : +3.11111111111124e+00
43.67/43.79 c Gap : 317.86 %
43.78/43.81 c NODE 13
43.78/43.81 c DUAL BOUND 3.11111
43.78/43.81 c PRIMAL BOUND 13
43.78/43.81 c GAP 3.17857
43.78/43.81 s SATISFIABLE
43.78/43.81 v x36 -x8 -x30 -x15 -x21 -x35 -x33 -x26 x7 x13 x6 x31 x5 -x22 -x23 -x29 -x17 -x11 -x14 -x18 -x20 -x24 -x9 x3 x34 x32 x28 x27 -x25
43.78/43.81 v -x19 -x16 x12 -x10 -x4 x2 -x1
43.78/43.81 c SCIP Status : solving was interrupted [solution limit reached]
43.78/43.81 c Solving Time : 42.99
43.78/43.81 c Original Problem :
43.78/43.81 c Problem name : HOME/instance-1884588-1245259578.opb
43.78/43.81 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
43.78/43.81 c Constraints : 15120 initial, 15120 maximal
43.78/43.81 c Presolved Problem :
43.78/43.81 c Problem name : t_HOME/instance-1884588-1245259578.opb
43.78/43.81 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
43.78/43.81 c Constraints : 7560 initial, 7560 maximal
43.78/43.81 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
43.78/43.81 c trivial : 0.00 0 0 0 0 0 0 0 0
43.78/43.81 c dualfix : 0.00 0 0 0 0 0 0 0 0
43.78/43.81 c boundshift : 0.00 0 0 0 0 0 0 0 0
43.78/43.81 c inttobinary : 0.00 0 0 0 0 0 0 0 0
43.78/43.81 c implics : 0.00 0 0 0 0 0 0 0 0
43.78/43.81 c probing : 0.00 0 0 0 0 0 0 0 0
43.78/43.81 c linear : 0.21 0 0 0 0 0 7560 0 0
43.78/43.81 c root node : - 0 - - 0 - - - -
43.78/43.81 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
43.78/43.81 c integral : 0 0 0 13 0 0 0 0 0 24
43.78/43.81 c linear : 7560 1 13 1 0 0 0 0 0 0
43.78/43.81 c countsols : 0 0 0 1 0 0 0 0 0 0
43.78/43.81 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
43.78/43.81 c integral : 41.62 0.00 0.00 41.62 0.00
43.78/43.81 c linear : 0.09 0.00 0.08 0.01 0.00
43.78/43.81 c countsols : 0.00 0.00 0.00 0.00 0.00
43.78/43.81 c Propagators : Time Calls Cutoffs DomReds
43.78/43.81 c rootredcost : 0.00 0 0 0
43.78/43.81 c pseudoobj : 0.00 14 0 0
43.78/43.81 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
43.78/43.81 c propagation : 0.00 0 0 0 0.0 0 0.0 -
43.78/43.81 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
43.78/43.81 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
43.78/43.81 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
43.78/43.81 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
43.78/43.81 c applied globally : - - - 0 0.0 - - -
43.78/43.81 c applied locally : - - - 0 0.0 - - -
43.78/43.81 c Separators : Time Calls Cutoffs DomReds Cuts Conss
43.78/43.81 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
43.78/43.81 c redcost : 0.00 13 0 0 0 0
43.78/43.81 c impliedbounds : 0.00 1 0 0 0 0
43.78/43.81 c intobj : 0.00 0 0 0 0 0
43.78/43.81 c gomory : 0.00 1 0 0 0 0
43.78/43.81 c strongcg : 0.01 1 0 0 0 0
43.78/43.81 c cmir : 0.00 0 0 0 0 0
43.78/43.81 c flowcover : 0.00 0 0 0 0 0
43.78/43.81 c clique : 0.00 1 0 0 0 0
43.78/43.81 c zerohalf : 0.00 0 0 0 0 0
43.78/43.81 c mcf : 0.00 0 0 0 0 0
43.78/43.81 c Pricers : Time Calls Vars
43.78/43.81 c problem variables: 0.00 0 0
43.78/43.81 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
43.78/43.81 c relpscost : 41.62 12 0 0 0 0 24
43.78/43.81 c pscost : 0.00 0 0 0 0 0 0
43.78/43.81 c inference : 0.00 0 0 0 0 0 0
43.78/43.81 c mostinf : 0.00 0 0 0 0 0 0
43.78/43.81 c leastinf : 0.00 0 0 0 0 0 0
43.78/43.81 c fullstrong : 0.00 0 0 0 0 0 0
43.78/43.81 c allfullstrong : 0.00 0 0 0 0 0 0
43.78/43.81 c random : 0.00 0 0 0 0 0 0
43.78/43.81 c Primal Heuristics : Time Calls Found
43.78/43.81 c LP solutions : 0.00 - 1
43.78/43.81 c pseudo solutions : 0.00 - 0
43.78/43.81 c simplerounding : 0.00 0 0
43.78/43.81 c rounding : 0.00 0 0
43.78/43.81 c shifting : 0.00 0 0
43.78/43.81 c intshifting : 0.00 0 0
43.78/43.81 c oneopt : 0.00 0 0
43.78/43.81 c fixandinfer : 0.00 0 0
43.78/43.81 c feaspump : 0.00 0 0
43.78/43.81 c coefdiving : 0.00 0 0
43.78/43.81 c pscostdiving : 0.00 0 0
43.78/43.81 c fracdiving : 0.00 0 0
43.78/43.81 c veclendiving : 0.00 0 0
43.78/43.81 c intdiving : 0.00 0 0
43.78/43.81 c actconsdiving : 0.00 0 0
43.78/43.81 c objpscostdiving : 0.00 0 0
43.78/43.81 c rootsoldiving : 0.00 0 0
43.78/43.81 c linesearchdiving : 0.00 0 0
43.78/43.81 c guideddiving : 0.00 0 0
43.78/43.81 c octane : 0.00 0 0
43.78/43.81 c rens : 0.00 0 0
43.78/43.81 c rins : 0.00 0 0
43.78/43.81 c localbranching : 0.00 0 0
43.78/43.81 c mutation : 0.00 0 0
43.78/43.81 c crossover : 0.00 0 0
43.78/43.81 c dins : 0.00 0 0
43.78/43.81 c LP : Time Calls Iterations Iter/call Iter/sec
43.78/43.81 c primal LP : 0.00 0 0 0.00 -
43.78/43.81 c dual LP : 0.92 13 464 35.69 504.35
43.78/43.81 c barrier LP : 0.00 0 0 0.00 -
43.78/43.81 c diving/probing LP: 0.00 0 0 0.00 -
43.78/43.81 c strong branching : 41.62 179 14891 83.19 357.78
43.78/43.81 c (at root node) : - 33 3683 111.61 -
43.78/43.81 c conflict analysis: 0.00 0 0 0.00 -
43.78/43.81 c B&B Tree :
43.78/43.81 c number of runs : 1
43.78/43.81 c nodes : 13
43.78/43.81 c nodes (total) : 13
43.78/43.81 c nodes left : 11
43.78/43.81 c max depth : 12
43.78/43.81 c max depth (total): 12
43.78/43.81 c backtracks : 0 (0.0%)
43.78/43.81 c delayed cutoffs : 0
43.78/43.81 c repropagations : 0 (0 domain reductions, 0 cutoffs)
43.78/43.81 c avg switch length: 1.00
43.78/43.81 c switching time : 0.00
43.78/43.81 c Solution :
43.78/43.81 c Solutions found : 1 (1 improvements)
43.78/43.81 c Primal Bound : +1.30000000000000e+01 (in run 1, after 13 nodes, 42.99 seconds, depth 12, found by <relaxation>)
43.78/43.81 c Dual Bound : +3.11111111111124e+00
43.78/43.81 c Gap : 317.86 %
43.78/43.81 c Root Dual Bound : +3.00000000000000e+00
43.78/43.90 c Time complete: 43.88.