0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-3733657-1338701175.opb>
0.00/0.01 c original problem has 3900 variables (3900 bin, 0 int, 0 impl, 0 cont) and 125 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 0 impls, 60 clqs
0.00/0.02 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 125 upgd conss, 0 impls, 60 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 60 cliques
0.00/0.03 c presolved problem has 3900 variables (3900 bin, 0 int, 0 impl, 0 cont) and 125 constraints
0.00/0.03 c 60 constraints of type <setppc>
0.00/0.03 c 65 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c SATUNSAT-LIN
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = c -1
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = c -1
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = c -1
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = c -1
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = c -1
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = c 2000
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = c 0.3
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = c -1
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = c -1
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = c -1
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = c -1
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = c 0.15
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = c 750
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = c -1
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = c 0
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = c 5
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = c 1
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = c 1
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = c 13950
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = c 1791
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = c 10000
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.06/0.07 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.07 c 0.0s| 1 | 0 | 1432 |8039k| 0 | - |3900 | 125 | 125 |3900 | 125 | 0 | 0 | 0 | -- | -- | 0.00%
0.06/0.07 c 0.0s| 1 | 0 | 1432 |8039k| 0 | - |3900 | 125 | 125 |3900 | 125 | 0 | 0 | 0 | -- | -- | 0.00%
0.06/0.07 c
0.06/0.07 c SCIP Status : problem is solved [infeasible]
0.06/0.07 c Solving Time (sec) : 0.04
0.06/0.07 c Solving Nodes : 1
0.06/0.07 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.06/0.07 c Dual Bound : +1.00000000000000e+20
0.06/0.07 c Gap : 0.00 %
0.06/0.07 c NODE 1
0.06/0.07 c DUAL BOUND 1e+20
0.06/0.07 c PRIMAL BOUND 1e+20
0.06/0.07 c GAP 0
0.06/0.07 s UNSATISFIABLE
0.06/0.07 c SCIP Status : problem is solved [infeasible]
0.06/0.07 c Solving Time : 0.04
0.06/0.07 c Original Problem :
0.06/0.07 c Problem name : HOME/instance-3733657-1338701175.opb
0.06/0.07 c Variables : 3900 (3900 binary, 0 integer, 0 implicit integer, 0 continuous)
0.06/0.07 c Constraints : 125 initial, 125 maximal
0.06/0.07 c Presolved Problem :
0.06/0.07 c Problem name : t_HOME/instance-3733657-1338701175.opb
0.06/0.07 c Variables : 3900 (3900 binary, 0 integer, 0 implicit integer, 0 continuous)
0.06/0.07 c Constraints : 125 initial, 125 maximal
0.06/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.06/0.07 c trivial : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c implics : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c probing : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c setppc : 0.00 0 0 0 0 0 0 0 0
0.06/0.07 c logicor : 0.01 0 0 0 0 0 0 0 0
0.06/0.07 c root node : - 0 - - 0 - - - -
0.06/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.06/0.07 c integral : 0 0 0 0 0 0 0 0 0 0
0.06/0.07 c setppc : 60 0 1 0 0 0 0 0 0 0
0.06/0.07 c logicor : 65 0 1 0 0 0 0 0 0 0
0.06/0.07 c countsols : 0 0 0 0 0 0 0 0 0 0
0.06/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.06/0.07 c integral : 0.00 0.00 0.00 0.00 0.00
0.06/0.07 c setppc : 0.00 0.00 0.00 0.00 0.00
0.06/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00
0.06/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00
0.06/0.07 c Propagators : Time Calls Cutoffs DomReds
0.06/0.07 c rootredcost : 0.00 0 0 0
0.06/0.07 c pseudoobj : 0.00 2 1 0
0.06/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.06/0.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.06/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.06/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.06/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.06/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.06/0.07 c applied globally : - - - 0 0.0 - - -
0.06/0.07 c applied locally : - - - 0 0.0 - - -
0.06/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.06/0.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.06/0.07 c redcost : 0.00 0 0 0 0 0
0.06/0.07 c impliedbounds : 0.00 0 0 0 0 0
0.06/0.07 c intobj : 0.00 0 0 0 0 0
0.06/0.07 c gomory : 0.00 0 0 0 0 0
0.06/0.07 c strongcg : 0.00 0 0 0 0 0
0.06/0.07 c cmir : 0.00 0 0 0 0 0
0.06/0.07 c flowcover : 0.00 0 0 0 0 0
0.06/0.07 c clique : 0.00 0 0 0 0 0
0.06/0.07 c zerohalf : 0.00 0 0 0 0 0
0.06/0.07 c mcf : 0.00 0 0 0 0 0
0.06/0.07 c Pricers : Time Calls Vars
0.06/0.07 c problem variables: 0.00 0 0
0.06/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.06/0.07 c pscost : 0.00 0 0 0 0 0 0
0.06/0.07 c inference : 0.00 0 0 0 0 0 0
0.06/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.06/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.06/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.06/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.06/0.07 c random : 0.00 0 0 0 0 0 0
0.06/0.07 c relpscost : 0.00 0 0 0 0 0 0
0.06/0.07 c Primal Heuristics : Time Calls Found
0.06/0.07 c LP solutions : 0.00 - 0
0.06/0.07 c pseudo solutions : 0.00 - 0
0.06/0.07 c simplerounding : 0.00 0 0
0.06/0.07 c rounding : 0.00 0 0
0.06/0.07 c shifting : 0.00 0 0
0.06/0.07 c intshifting : 0.00 0 0
0.06/0.07 c oneopt : 0.00 0 0
0.06/0.07 c fixandinfer : 0.00 0 0
0.06/0.07 c feaspump : 0.00 0 0
0.06/0.07 c coefdiving : 0.00 0 0
0.06/0.07 c pscostdiving : 0.00 0 0
0.06/0.07 c fracdiving : 0.00 0 0
0.06/0.07 c veclendiving : 0.00 0 0
0.06/0.07 c intdiving : 0.00 0 0
0.06/0.07 c actconsdiving : 0.00 0 0
0.06/0.07 c objpscostdiving : 0.00 0 0
0.06/0.07 c rootsoldiving : 0.00 0 0
0.06/0.07 c linesearchdiving : 0.00 0 0
0.06/0.07 c guideddiving : 0.00 0 0
0.06/0.07 c octane : 0.00 0 0
0.06/0.07 c rens : 0.00 0 0
0.06/0.07 c rins : 0.00 0 0
0.06/0.07 c localbranching : 0.00 0 0
0.06/0.07 c mutation : 0.00 0 0
0.06/0.07 c crossover : 0.00 0 0
0.06/0.07 c dins : 0.00 0 0
0.06/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.06/0.07 c primal LP : 0.00 0 0 0.00 -
0.06/0.07 c dual LP : 0.03 1 1432 1432.00 47733.33
0.06/0.07 c barrier LP : 0.00 0 0 0.00 -
0.06/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.06/0.07 c strong branching : 0.00 0 0 0.00 -
0.06/0.07 c (at root node) : - 0 0 0.00 -
0.06/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.06/0.07 c B&B Tree :
0.06/0.07 c number of runs : 1
0.06/0.07 c nodes : 1
0.06/0.07 c nodes (total) : 1
0.06/0.07 c nodes left : 0
0.06/0.07 c max depth : 0
0.06/0.07 c max depth (total): 0
0.06/0.07 c backtracks : 0 (0.0%)
0.06/0.07 c delayed cutoffs : 0
0.06/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.06/0.07 c avg switch length: 2.00
0.06/0.07 c switching time : 0.00
0.06/0.07 c Solution :
0.06/0.07 c Solutions found : 0 (0 improvements)
0.06/0.07 c Primal Bound : infeasible
0.06/0.07 c Dual Bound : -
0.06/0.07 c Gap : 0.00 %
0.06/0.07 c Root Dual Bound : -
0.06/0.08 c Time complete: 0.07.