0.29/0.38 c SCIP version 1.1.0.7
0.29/0.38 c LP-Solver SoPlex 1.4.1
0.29/0.38 c user parameter file <scip.set> not found - using default parameters
0.29/0.38 c read problem <HOME/instance-1884587-1245259577.opb>
0.29/0.38 c original problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 15120 constraints
0.39/0.48 c No objective function, only one solution is needed.
0.39/0.48 c start presolving problem
0.39/0.48 c presolving:
0.59/0.65 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.70/0.74 c presolving (2 rounds):
0.70/0.74 c 0 deleted vars, 7560 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.70/0.74 c 0 implications, 0 cliques
0.70/0.74 c presolved problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 7560 constraints
0.70/0.74 c 7560 constraints of type <linear>
0.70/0.74 c transformed objective value is always integral (scale: 1)
0.70/0.74 c Presolving Time: 0.23
0.70/0.74 c SATUNSAT-LIN
0.70/0.74 c -----------------------------------------------------------------------------------------------
0.70/0.74 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 0]
0.70/0.74 c separating/flowcover/freq = c -1
0.70/0.74 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 0]
0.70/0.74 c separating/cmir/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/veclendiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.70/0.74 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/veclendiving/freq = c -1
0.70/0.74 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 1]
0.70/0.74 c heuristics/simplerounding/freq = c -1
0.70/0.74 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/shifting/freq = c -1
0.70/0.74 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 1]
0.70/0.74 c heuristics/rounding/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.70/0.74 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.70/0.74 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 20]
0.70/0.74 c heuristics/rootsoldiving/freq = c -1
0.70/0.74 c # number of nodes added to the contingent of the total nodes
0.70/0.74 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.70/0.74 c heuristics/rens/nodesofs = c 2000
0.70/0.74 c # minimum percentage of integer variables that have to be fixable
0.70/0.74 c # [type: real, range: [0,1], default: 0.5]
0.70/0.74 c heuristics/rens/minfixingrate = c 0.3
0.70/0.74 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 0]
0.70/0.74 c heuristics/rens/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.70/0.74 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/pscostdiving/freq = c -1
0.70/0.74 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 1]
0.70/0.74 c heuristics/oneopt/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to total iteration number
0.70/0.74 c # [type: real, range: [0,1], default: 0.01]
0.70/0.74 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.70/0.74 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 20]
0.70/0.74 c heuristics/objpscostdiving/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.70/0.74 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/linesearchdiving/freq = c -1
0.70/0.74 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/intshifting/freq = c -1
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/intdiving/maxlpiterquot = c 0.075
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/guideddiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.70/0.74 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/guideddiving/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/fracdiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.70/0.74 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/fracdiving/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/feaspump/maxlpiterofs = c 2000
0.70/0.74 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 20]
0.70/0.74 c heuristics/feaspump/freq = c -1
0.70/0.74 c # minimum percentage of integer variables that have to be fixed
0.70/0.74 c # [type: real, range: [0,1], default: 0.666]
0.70/0.74 c heuristics/crossover/minfixingrate = c 0.5
0.70/0.74 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.70/0.74 c # [type: real, range: [0,1], default: 0.1]
0.70/0.74 c heuristics/crossover/nodesquot = c 0.15
0.70/0.74 c # number of nodes without incumbent change that heuristic should wait
0.70/0.74 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.70/0.74 c heuristics/crossover/nwaitingnodes = c 100
0.70/0.74 c # number of nodes added to the contingent of the total nodes
0.70/0.74 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.70/0.74 c heuristics/crossover/nodesofs = c 750
0.70/0.74 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 30]
0.70/0.74 c heuristics/crossover/freq = c -1
0.70/0.74 c # additional number of allowed LP iterations
0.70/0.74 c # [type: int, range: [0,2147483647], default: 1000]
0.70/0.74 c heuristics/coefdiving/maxlpiterofs = c 1500
0.70/0.74 c # maximal fraction of diving LP iterations compared to node LP iterations
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.70/0.74 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.70/0.74 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 10]
0.70/0.74 c heuristics/coefdiving/freq = c -1
0.70/0.74 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: -1]
0.70/0.74 c presolving/probing/maxrounds = c 0
0.70/0.74 c # should presolving try to simplify knapsacks
0.70/0.74 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.70/0.74 c constraints/knapsack/simplifyinequalities = c TRUE
0.70/0.74 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.70/0.74 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.70/0.74 c constraints/knapsack/disaggregation = c FALSE
0.70/0.74 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: -1]
0.70/0.74 c constraints/knapsack/maxnumcardlift = c 0
0.70/0.74 c # should presolving try to simplify inequalities
0.70/0.74 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.70/0.74 c constraints/linear/simplifyinequalities = c TRUE
0.70/0.74 c # maximal number of separation rounds in the root node (-1: unlimited)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: -1]
0.70/0.74 c separating/maxroundsroot = c 5
0.70/0.74 c # maximal number of separation rounds per node (-1: unlimited)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 5]
0.70/0.74 c separating/maxrounds = c 1
0.70/0.74 c # solving stops, if the given number of solutions were found (-1: no limit)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: -1]
0.70/0.74 c limits/solutions = c 1
0.70/0.74 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.70/0.74 c limits/memory = c 1620
0.70/0.74 c # maximal time in seconds to run
0.70/0.74 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.70/0.74 c limits/time = c 1791
0.70/0.74 c # frequency for displaying node information lines
0.70/0.74 c # [type: int, range: [-1,2147483647], default: 100]
0.70/0.74 c display/freq = c 10000
0.70/0.74 c -----------------------------------------------------------------------------------------------
0.70/0.74 c start solving problem
0.70/0.74 c
0.99/1.05 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.05 c 0.6s| 1 | 0 | 48 | 24M| 0 | 36 | 36 |7560 |7560 | 36 |7560 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
14.49/14.51 c 14.0s| 1 | 2 | 48 | 24M| 0 | 36 | 36 |7560 |7560 | 36 |7560 | 0 | 0 | 33 | 3.000000e+00 | -- | Inf
52.07/52.17 c *51.6s| 11 | 9 | 588 | 24M| 10 | - | 36 |7560 |7560 | 36 |7560 | 0 | 0 | 134 | 3.111111e+00 | 1.100000e+01 | 253.57%
52.07/52.17 c
52.07/52.17 c SCIP Status : solving was interrupted [solution limit reached]
52.07/52.17 c Solving Time (sec) : 51.60
52.07/52.17 c Solving Nodes : 11
52.07/52.17 c Primal Bound : +1.10000000000000e+01 (1 solutions)
52.07/52.17 c Dual Bound : +3.11111111111111e+00
52.07/52.17 c Gap : 253.57 %
52.07/52.19 c NODE 11
52.07/52.19 c DUAL BOUND 3.11111
52.07/52.19 c PRIMAL BOUND 11
52.07/52.19 c GAP 2.53571
52.07/52.19 s SATISFIABLE
52.07/52.19 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
52.07/52.19 v -x19 -x16 -x12 -x10 -x4 -x2 -x1
52.07/52.19 c SCIP Status : solving was interrupted [solution limit reached]
52.07/52.19 c Solving Time : 51.60
52.07/52.19 c Original Problem :
52.07/52.19 c Problem name : HOME/instance-1884587-1245259577.opb
52.07/52.19 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
52.07/52.19 c Constraints : 15120 initial, 15120 maximal
52.07/52.19 c Presolved Problem :
52.07/52.19 c Problem name : t_HOME/instance-1884587-1245259577.opb
52.07/52.19 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
52.07/52.19 c Constraints : 7560 initial, 7560 maximal
52.07/52.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
52.07/52.19 c trivial : 0.00 0 0 0 0 0 0 0 0
52.07/52.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
52.07/52.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
52.07/52.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
52.07/52.19 c implics : 0.00 0 0 0 0 0 0 0 0
52.07/52.19 c probing : 0.00 0 0 0 0 0 0 0 0
52.07/52.19 c linear : 0.21 0 0 0 0 0 7560 0 0
52.07/52.19 c root node : - 0 - - 0 - - - -
52.07/52.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
52.07/52.19 c integral : 0 0 0 11 0 0 0 0 0 20
52.07/52.19 c linear : 7560 1 11 1 0 0 0 0 0 0
52.07/52.19 c countsols : 0 0 0 1 0 0 0 0 0 0
52.07/52.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
52.07/52.19 c integral : 48.94 0.00 0.00 48.94 0.00
52.07/52.19 c linear : 0.08 0.01 0.07 0.00 0.00
52.07/52.19 c countsols : 0.00 0.00 0.00 0.00 0.00
52.07/52.19 c Propagators : Time Calls Cutoffs DomReds
52.07/52.19 c rootredcost : 0.00 0 0 0
52.07/52.19 c pseudoobj : 0.00 12 0 0
52.07/52.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
52.07/52.19 c propagation : 0.00 0 0 0 0.0 0 0.0 -
52.07/52.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
52.07/52.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
52.07/52.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
52.07/52.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
52.07/52.19 c applied globally : - - - 0 0.0 - - -
52.07/52.19 c applied locally : - - - 0 0.0 - - -
52.07/52.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
52.07/52.19 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
52.07/52.19 c redcost : 0.00 11 0 0 0 0
52.07/52.19 c impliedbounds : 0.00 1 0 0 0 0
52.07/52.19 c intobj : 0.00 0 0 0 0 0
52.07/52.19 c gomory : 0.01 1 0 0 0 0
52.07/52.19 c strongcg : 0.00 1 0 0 0 0
52.07/52.19 c cmir : 0.00 0 0 0 0 0
52.07/52.19 c flowcover : 0.00 0 0 0 0 0
52.07/52.19 c clique : 0.00 1 0 0 0 0
52.07/52.19 c zerohalf : 0.00 0 0 0 0 0
52.07/52.19 c mcf : 0.00 0 0 0 0 0
52.07/52.19 c Pricers : Time Calls Vars
52.07/52.19 c problem variables: 0.00 0 0
52.07/52.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
52.07/52.19 c relpscost : 48.94 10 0 0 0 0 20
52.07/52.19 c pscost : 0.00 0 0 0 0 0 0
52.07/52.19 c inference : 0.00 0 0 0 0 0 0
52.07/52.19 c mostinf : 0.00 0 0 0 0 0 0
52.07/52.19 c leastinf : 0.00 0 0 0 0 0 0
52.07/52.19 c fullstrong : 0.00 0 0 0 0 0 0
52.07/52.19 c allfullstrong : 0.00 0 0 0 0 0 0
52.07/52.19 c random : 0.00 0 0 0 0 0 0
52.07/52.19 c Primal Heuristics : Time Calls Found
52.07/52.19 c LP solutions : 0.00 - 1
52.07/52.19 c pseudo solutions : 0.00 - 0
52.07/52.19 c simplerounding : 0.00 0 0
52.07/52.19 c rounding : 0.00 0 0
52.07/52.19 c shifting : 0.00 0 0
52.07/52.19 c intshifting : 0.00 0 0
52.07/52.19 c oneopt : 0.00 0 0
52.07/52.19 c fixandinfer : 0.00 0 0
52.07/52.19 c feaspump : 0.00 0 0
52.07/52.19 c coefdiving : 0.00 0 0
52.07/52.19 c pscostdiving : 0.00 0 0
52.07/52.19 c fracdiving : 0.00 0 0
52.07/52.19 c veclendiving : 0.00 0 0
52.07/52.19 c intdiving : 0.00 0 0
52.07/52.19 c actconsdiving : 0.00 0 0
52.07/52.19 c objpscostdiving : 0.00 0 0
52.07/52.19 c rootsoldiving : 0.00 0 0
52.07/52.19 c linesearchdiving : 0.00 0 0
52.07/52.19 c guideddiving : 0.00 0 0
52.07/52.19 c octane : 0.00 0 0
52.07/52.19 c rens : 0.00 0 0
52.07/52.19 c rins : 0.00 0 0
52.07/52.19 c localbranching : 0.00 0 0
52.07/52.19 c mutation : 0.00 0 0
52.07/52.19 c crossover : 0.00 0 0
52.07/52.19 c dins : 0.00 0 0
52.07/52.19 c LP : Time Calls Iterations Iter/call Iter/sec
52.07/52.19 c primal LP : 0.00 0 0 0.00 -
52.07/52.19 c dual LP : 2.21 11 588 53.45 266.06
52.07/52.19 c barrier LP : 0.00 0 0 0.00 -
52.07/52.19 c diving/probing LP: 0.00 0 0 0.00 -
52.07/52.19 c strong branching : 48.94 134 8665 64.66 177.05
52.07/52.19 c (at root node) : - 33 1798 54.48 -
52.07/52.19 c conflict analysis: 0.00 0 0 0.00 -
52.07/52.19 c B&B Tree :
52.07/52.19 c number of runs : 1
52.07/52.19 c nodes : 11
52.07/52.19 c nodes (total) : 11
52.07/52.19 c nodes left : 9
52.07/52.19 c max depth : 10
52.07/52.19 c max depth (total): 10
52.07/52.19 c backtracks : 0 (0.0%)
52.07/52.19 c delayed cutoffs : 0
52.07/52.19 c repropagations : 0 (0 domain reductions, 0 cutoffs)
52.07/52.19 c avg switch length: 1.00
52.07/52.19 c switching time : 0.00
52.07/52.19 c Solution :
52.07/52.19 c Solutions found : 1 (1 improvements)
52.07/52.19 c Primal Bound : +1.10000000000000e+01 (in run 1, after 11 nodes, 51.60 seconds, depth 10, found by <relaxation>)
52.07/52.19 c Dual Bound : +3.11111111111111e+00
52.07/52.19 c Gap : 253.57 %
52.07/52.19 c Root Dual Bound : +3.00000000000000e+00
52.17/52.28 c Time complete: 52.25.