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