0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664881-1276679331.opb>
0.09/0.10 c original problem has 7316 variables (7316 bin, 0 int, 0 impl, 0 cont) and 7818 constraints
0.09/0.10 c problem read
0.09/0.10 c No objective function, only one solution is needed.
0.09/0.10 c presolving settings loaded
0.09/0.20 c presolving:
0.39/0.49 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1501 upgd conss, 51528 impls, 1000 clqs
0.70/0.74 c presolving (2 rounds):
0.70/0.74 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.70/0.74 c 51528 implications, 1000 cliques
0.70/0.74 c presolved problem has 7316 variables (7316 bin, 0 int, 0 impl, 0 cont) and 7818 constraints
0.70/0.74 c 1 constraints of type <knapsack>
0.70/0.74 c 1000 constraints of type <setppc>
0.70/0.74 c 6316 constraints of type <and>
0.70/0.74 c 1 constraints of type <linear>
0.70/0.74 c 500 constraints of type <logicor>
0.70/0.74 c transformed objective value is always integral (scale: 1)
0.70/0.74 c Presolving Time: 0.39
0.70/0.74 c - non default parameters ----------------------------------------------------------------------
0.70/0.74 c # SCIP version 1.2.1.2
0.70/0.74 c
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 = 10000
0.70/0.74 c
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 = 1799.9
0.70/0.74 c
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 = 1620
0.70/0.74 c
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 = 1
0.70/0.74 c
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 = 1
0.70/0.74 c
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 = 5
0.70/0.74 c
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 = TRUE
0.70/0.74 c
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 = FALSE
0.70/0.74 c
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 = TRUE
0.70/0.74 c
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 = 0
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = 1500
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 750
0.70/0.74 c
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 = 100
0.70/0.74 c
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 = 0.15
0.70/0.74 c
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 = 0.5
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 2000
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = 1500
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = 1500
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = 1500
0.70/0.74 c
0.70/0.74 c # frequency for calling primal heuristic <nlp> (-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/nlp/freq = -1
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.015
0.70/0.74 c
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 = 1500
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = 1500
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.3
0.70/0.74 c
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 = 2000
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.015
0.70/0.74 c
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 = 1500
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = -1
0.70/0.74 c
0.70/0.74 c # frequency for calling primal heuristic <trivial> (-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/trivial/freq = -1
0.70/0.74 c
0.70/0.74 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
0.70/0.74 c
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 = -1
0.70/0.74 c
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 = 0.075
0.70/0.74 c
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 = 1500
0.70/0.74 c
0.70/0.74 c # frequency for calling primal heuristic <zirounding> (-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/zirounding/freq = -1
0.70/0.74 c
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 = -1
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 = -1
0.70/0.74 c
0.70/0.74 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.70/0.74 c # [type: int, range: [-1,2147483647], default: -1]
0.70/0.74 c separating/rapidlearning/freq = 0
0.70/0.74 c
0.70/0.74 c -----------------------------------------------------------------------------------------------
0.70/0.74 c start solving
0.70/0.75 c
1.19/1.22 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.22 c 0.9s| 1 | 0 | 598 | - | 33M| 0 | 337 |7316 |7818 |7316 | 14k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.29/4.33 c 3.7s| 1 | 0 | 647 | - | 37M| 0 | 332 |7316 |7818 |7316 | 14k| 9 | 0 | 0 | 0.000000e+00 | -- | Inf
6.39/6.42 c 5.8s| 1 | 0 | 694 | - | 41M| 0 | 314 |7316 |7818 |7316 | 14k| 24 | 0 | 0 | 0.000000e+00 | -- | Inf
8.49/8.53 c 7.9s| 1 | 0 | 727 | - | 45M| 0 | 295 |7316 |7818 |7316 | 14k| 33 | 0 | 0 | 0.000000e+00 | -- | Inf
10.59/10.67 c 10.0s| 1 | 0 | 803 | - | 48M| 0 | 316 |7316 |7818 |7316 | 14k| 47 | 0 | 0 | 0.000000e+00 | -- | Inf
12.99/13.04 c 12.3s| 1 | 0 | 894 | - | 52M| 0 | 342 |7316 |7818 |7316 | 14k| 56 | 0 | 0 | 0.000000e+00 | -- | Inf
14.39/14.45 c 13.7s| 1 | 2 | 894 | - | 52M| 0 | 342 |7316 |7818 |7316 | 14k| 56 | 0 | 10 | 0.000000e+00 | -- | Inf
65.78/65.81 c *64.4s| 195 | 0 | 7166 | 32.3 | 52M| 145 | - |7316 |7827 |7316 |2184 |2603 | 9 |1821 | 0.000000e+00 | 0.000000e+00 | 0.00%
65.78/65.83 c
65.78/65.83 c SCIP Status : problem is solved [optimal solution found]
65.78/65.83 c Solving Time (sec) : 64.39
65.78/65.83 c Solving Nodes : 195
65.78/65.83 c Primal Bound : +0.00000000000000e+00 (1 solutions)
65.78/65.83 c Dual Bound : +0.00000000000000e+00
65.78/65.83 c Gap : 0.00 %
65.78/65.85 s SATISFIABLE
65.78/65.85 v -x972 -x966 -x919 -x636 -x861 -x917 x717 -x934 x847 -x605 -x902 -x677 -x979 -x779 x987 -x849 -x662 x701 x629 -x888 x913 -x850 -x995
65.78/65.85 v -x879 -x881 -x935 -x971 x929 -x901 -x756 -x710 x818 -x865 -x631 -x680 x589 -x718 x798 x910 x767 x719 -x764 -x706 -x583 -x801
65.78/65.85 v -x813 -x870 -x597 -x666 -x909 -x856 -x880 -x612 -x797 -x954 -x980 -x961 -x873 -x698 -x577 -x915 x556 -x864 -x760 -x725 -x632
65.78/65.85 v -x615 -x670 -x651 -x946 -x885 -x735 -x942 -x630 -x897 -x592 -x552 -x758 -x693 -x997 -x793 -x943 -x694 -x561 -x794 -x904
65.78/65.85 v -x857 -x679 -x600 -x560 -x911 -x827 -x752 -x696 -x982 -x755 -x884 -x628 -x922 -x551 -x555 x546 -x970 -x959 -x585 -x784 -x674
65.78/65.85 v -x686 -x860 -x683 -x825 -x641 -x624 -x608 -x547 -x721 -x749 -x668 -x862 -x918 -x736 -x832 -x895 x606 -x903 -x763 x619 -x722 -x855
65.78/65.85 v -x957 -x947 -x744 -x682 -x566 x541 -x730 -x754 -x587 -x834 -x780 -x1000 -x688 -x609 -x990 -x663 -x819 -x713 -x731 -x673
65.78/65.85 v -x635 -x921 -x581 -x665 -x965 -x729 -x610 -x690 -x633 -x891 -x930 -x912 -x697 -x650 -x700 -x664 x958 -x676 -x720 -x598 -x595
65.78/65.85 v -x750 -x703 -x726 -x766 -x738 -x550 x815 -x675 -x578 -x528 -x768 -x621 -x584 -x709 -x981 -x527 -x773 -x611 -x787 -x596 x839 -x705
65.78/65.85 v -x920 -x853 -x711 -x593 -x762 -x778 -x928 -x733 -x525 -x848 x753 -x742 -x734 -x808 -x962 -x821 -x833 -x823 -x524 -x892 -x772
65.78/65.85 v -x751 -x554 -x538 -x659 -x846 -x876 -x989 -x534 -x523 -x977 -x967 -x824 -x820 x814 -x656 -x654 -x618 -x639 -x645 x564 x599
65.78/65.85 v -x692 -x974 -x956 -x940 -x836 -x580 -x530 -x800 -x843 -x667 -x840 x571 -x520 -x810 x594 -x851 x607 -x708 -x714 x545 -x519
65.78/65.85 v -x933 -x644 x620 -x775 -x985 -x657 -x518 x932 -x788 x770 -x614 -x601 -x548 -x844 -x828 -x944 -x789 x748 -x991 -x875 -x783 -x671
65.78/65.85 v -x575 -x691 -x533 -x893 -x811 -x712 -x949 -x771 -x952 -x627 x590 -x563 -x988 -x785 -x732 -x890 -x660 -x586 x704 -x536 -x514
65.78/65.85 v -x964 -x863 -x521 -x515 -x723 -x746 x716 -x602 -x871 -x852 -x945 -x689 -x544 -x513 -x937 -x869 -x829 -x582 -x532 x526 -x535
65.78/65.85 v -x931 -x739 -x553 -x950 -x973 -x795 -x512 -x845 x803 -x616 -x565 x543 -x672 -x724 -x681 -x804 -x728 -x817 -x511 -x777 -x737
65.78/65.85 v -x684 -x678 -x558 x522 -x622 -x994 -x899 -x830 -x510 -x960 -x638 -x540 -x537 -x806 -x757 -x984 x646 -x874 -x999 -x769 -x907 -x927
65.78/65.85 v -x509 -x841 -x761 -x626 -x613 x604 -x539 -x914 -x992 -x741 -x727 -x707 -x905 -x978 -x567 -x854 -x868 x826 -x792 -x617 x517
65.78/65.85 v -x816 -x743 x812 x951 -x998 -x882 -x867 -x661 x658 x623 -x568 -x924 -x809 -x634 x878 x968 -x572 x872 -x642 -x506 -x831 -x936
65.78/65.85 v -x805 -x687 -x786 -x837 -x898 x549 x838 -x625 x790 -x505 x906 -x883 x835 x796 -x699 x685 x647 -x570 -x557 x529 x900 -x983
65.78/65.85 v x923 x653 -x782 x948 -x889 x588 -x993 -x649 x504 x953 -x807 -x781 -x745 -x640 x695 x569 -x791 -x579 -x916 -x562 x507 x975 -x637
65.78/65.85 v -x715 x503 -x963 -x887 x652 x576 x559 x508 -x955 -x799 -x969 -x938 -x886 -x648 -x774 -x759 -x939 -x643 -x502 x996 -x655 -x542
65.78/65.85 v x516 -x896 -x702 -x976 -x842 -x603 x740 -x894 -x925 -x501 -x908 -x866 -x858 -x822 -x776 -x591 -x574 -x531 -x859 x765 -x802
65.78/65.85 v -x877 -x573 -x926 -x941 -x669 -x986 -x747 -x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487
65.78/65.85 v x486 -x485 -x484 -x483 x482 -x481 x480 -x479 -x478 -x477 x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466
65.78/65.85 v -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445
65.78/65.85 v -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 -x430 -x429 -x428 -x427 -x426 x425 -x424
65.78/65.85 v -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 x403
65.78/65.85 v -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382
65.78/65.85 v -x381 x380 x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 x365 -x364 -x363 -x362 -x361 -x360
65.78/65.85 v x359 x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 x345 -x344 -x343 -x342 -x341 -x340 -x339
65.78/65.85 v -x338 x337 x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 x323 -x322 x321 -x320 -x319 -x318
65.78/65.85 v -x317 -x316 -x315 -x314 x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 x301 -x300 -x299 -x298 -x297 -x296
65.78/65.85 v -x295 -x294 -x293 -x292 -x291 -x290 -x289 x288 -x287 -x286 -x285 -x284 -x283 -x282 x281 -x280 -x279 -x278 -x277 -x276 -x275
65.78/65.85 v -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254
65.78/65.85 v -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 x238 -x237 -x236 -x235 -x234 -x233
65.78/65.85 v -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212
65.78/65.85 v -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192
65.78/65.85 v -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 x178 -x177 x176 -x175 -x174 -x173 -x172 -x171 -x170
65.78/65.85 v -x169 -x168 -x167 -x166 x165 -x164 -x163 x162 -x161 x160 x159 -x158 x157 -x156 -x155 x154 -x153 -x152 x151 x150 x149 -x148
65.78/65.85 v -x147 -x146 x145 x144 x143 x142 -x141 -x140 x139 x138 -x137 x136 x135 -x134 x133 x132 -x131 -x130 -x129 x128 -x127 -x126 x125
65.78/65.85 v -x124 -x123 x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 -x114 x113 -x112 x111 x110 x109 -x108 -x107 -x106 x105 -x104 x103
65.78/65.85 v x102 -x101 -x100 -x99 x98 -x97 x96 -x95 -x94 -x93 -x92 x91 -x90 -x89 -x88 x87 x86 -x85 x84 x83 -x82 -x81 -x80 -x79 -x78 x77
65.78/65.85 v -x76 -x75 -x74 x73 -x72 -x71 x70 -x69 -x68 -x67 x66 x65 -x64 -x63 -x62 -x61 x60 -x59 -x58 x57 -x56 -x55 x54 x53 -x52 -x51 -x50
65.78/65.85 v -x49 -x48 -x47 -x46 -x45 x44 -x43 x42 -x41 -x40 -x39 -x38 x37 x36 -x35 -x34 -x33 x32 x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
65.78/65.85 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
65.78/65.85 c SCIP Status : problem is solved [optimal solution found]
65.78/65.85 c Solving Time : 64.39
65.78/65.85 c Original Problem :
65.78/65.85 c Problem name : HOME/instance-2664881-1276679331.opb
65.78/65.85 c Variables : 7316 (7316 binary, 0 integer, 0 implicit integer, 0 continuous)
65.78/65.85 c Constraints : 7818 initial, 7818 maximal
65.78/65.85 c Presolved Problem :
65.78/65.85 c Problem name : t_HOME/instance-2664881-1276679331.opb
65.78/65.85 c Variables : 7316 (7316 binary, 0 integer, 0 implicit integer, 0 continuous)
65.78/65.85 c Constraints : 7818 initial, 7827 maximal
65.78/65.85 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
65.78/65.85 c trivial : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c dualfix : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c boundshift : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c inttobinary : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c implics : 0.01 0 0 0 0 0 0 0 0
65.78/65.85 c probing : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c knapsack : 0.04 0 0 0 0 0 0 0 0
65.78/65.85 c setppc : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c and : 0.22 0 0 0 0 0 0 0 0
65.78/65.85 c linear : 0.05 0 0 0 0 0 0 0 0
65.78/65.85 c logicor : 0.00 0 0 0 0 0 0 0 0
65.78/65.85 c root node : - 0 - - 0 - - - -
65.78/65.85 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
65.78/65.85 c integral : 0 0 0 196 0 0 9 0 0 370
65.78/65.85 c knapsack : 1 5 767 5 0 0 0 0 0 0
65.78/65.85 c setppc : 1000 5 767 5 0 8 569 0 0 0
65.78/65.85 c and : 6316 190 759 5 0 1 6240 2561 0 0
65.78/65.85 c linear : 1 5 758 1 0 0 0 0 0 0
65.78/65.85 c logicor : 500+ 5 271 1 0 0 86 0 0 0
65.78/65.85 c countsols : 0 0 0 1 0 0 0 0 0 0
65.78/65.85 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
65.78/65.85 c integral : 30.81 0.00 0.00 30.81 0.00
65.78/65.85 c knapsack : 0.52 0.50 0.02 0.00 0.00
65.78/65.85 c setppc : 0.00 0.00 0.00 0.00 0.00
65.78/65.85 c and : 0.80 0.60 0.20 0.00 0.00
65.78/65.85 c linear : 0.09 0.00 0.09 0.00 0.00
65.78/65.85 c logicor : 0.01 0.00 0.01 0.00 0.00
65.78/65.85 c countsols : 0.00 0.00 0.00 0.00 0.00
65.78/65.85 c Propagators : Time Calls Cutoffs DomReds
65.78/65.85 c vbounds : 0.00 1 0 0
65.78/65.85 c rootredcost : 0.00 0 0 0
65.78/65.85 c pseudoobj : 0.00 0 0 0
65.78/65.85 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
65.78/65.85 c propagation : 0.00 9 9 9 2.9 0 0.0 -
65.78/65.85 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
65.78/65.85 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
65.78/65.85 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
65.78/65.85 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
65.78/65.85 c applied globally : - - - 9 2.9 - - -
65.78/65.85 c applied locally : - - - 0 0.0 - - -
65.78/65.85 c Separators : Time Calls Cutoffs DomReds Cuts Conss
65.78/65.85 c cut pool : 0.01 4 - - 1 - (maximal pool size: 946)
65.78/65.85 c redcost : 0.18 190 0 0 0 0
65.78/65.85 c impliedbounds : 0.02 5 0 0 27 0
65.78/65.85 c intobj : 0.00 0 0 0 0 0
65.78/65.85 c cgmip : 0.00 0 0 0 0 0
65.78/65.85 c gomory : 4.65 5 0 0 222 0
65.78/65.85 c strongcg : 4.66 5 0 0 2500 0
65.78/65.85 c cmir : 0.00 0 0 0 0 0
65.78/65.85 c flowcover : 0.00 0 0 0 0 0
65.78/65.85 c clique : 0.15 5 0 0 30 0
65.78/65.85 c zerohalf : 0.00 0 0 0 0 0
65.78/65.85 c mcf : 0.03 1 0 0 0 0
65.78/65.85 c rapidlearning : 0.86 1 0 0 0 0
65.78/65.85 c Pricers : Time Calls Vars
65.78/65.85 c problem variables: 0.00 0 0
65.78/65.85 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
65.78/65.85 c relpscost : 30.81 191 0 9 0 0 370
65.78/65.85 c pscost : 0.00 0 0 0 0 0 0
65.78/65.85 c inference : 0.00 0 0 0 0 0 0
65.78/65.85 c mostinf : 0.00 0 0 0 0 0 0
65.78/65.85 c leastinf : 0.00 0 0 0 0 0 0
65.78/65.85 c fullstrong : 0.00 0 0 0 0 0 0
65.78/65.85 c allfullstrong : 0.00 0 0 0 0 0 0
65.78/65.85 c random : 0.00 0 0 0 0 0 0
65.78/65.85 c Primal Heuristics : Time Calls Found
65.78/65.85 c LP solutions : 0.00 - 1
65.78/65.85 c pseudo solutions : 0.00 - 0
65.78/65.85 c trivial : 0.02 1 0
65.78/65.85 c simplerounding : 0.00 0 0
65.78/65.85 c zirounding : 0.00 0 0
65.78/65.85 c rounding : 0.00 0 0
65.78/65.85 c shifting : 0.00 0 0
65.78/65.85 c intshifting : 0.00 0 0
65.78/65.85 c oneopt : 0.00 0 0
65.78/65.85 c twoopt : 0.00 0 0
65.78/65.85 c fixandinfer : 0.00 0 0
65.78/65.85 c feaspump : 0.00 0 0
65.78/65.85 c coefdiving : 0.00 0 0
65.78/65.85 c pscostdiving : 0.00 0 0
65.78/65.85 c fracdiving : 0.00 0 0
65.78/65.85 c veclendiving : 0.00 0 0
65.78/65.85 c intdiving : 0.00 0 0
65.78/65.85 c actconsdiving : 0.00 0 0
65.78/65.85 c objpscostdiving : 0.00 0 0
65.78/65.85 c rootsoldiving : 0.00 0 0
65.78/65.85 c linesearchdiving : 0.00 0 0
65.78/65.85 c guideddiving : 0.00 0 0
65.78/65.85 c octane : 0.00 0 0
65.78/65.85 c rens : 0.00 0 0
65.78/65.85 c rins : 0.00 0 0
65.78/65.85 c localbranching : 0.00 0 0
65.78/65.85 c mutation : 0.00 0 0
65.78/65.85 c crossover : 0.00 0 0
65.78/65.85 c dins : 0.00 0 0
65.78/65.85 c undercover : 0.00 0 0
65.78/65.85 c nlp : 0.00 0 0
65.78/65.85 c trysol : 0.00 0 0
65.78/65.85 c LP : Time Calls Iterations Iter/call Iter/sec
65.78/65.85 c primal LP : 6.84 0 0 0.00 0.00
65.78/65.85 c dual LP : 12.35 379 7166 18.91 580.24
65.78/65.85 c lex dual LP : 0.00 0 0 0.00 -
65.78/65.85 c barrier LP : 0.00 0 0 0.00 -
65.78/65.85 c diving/probing LP: 0.00 0 0 0.00 -
65.78/65.85 c strong branching : 30.74 1821 53627 29.45 1744.53
65.78/65.85 c (at root node) : - 10 899 89.90 -
65.78/65.85 c conflict analysis: 0.00 0 0 0.00 -
65.78/65.85 c B&B Tree :
65.78/65.85 c number of runs : 1
65.78/65.85 c nodes : 195
65.78/65.85 c nodes (total) : 195
65.78/65.85 c nodes left : 0
65.78/65.85 c max depth : 145
65.78/65.85 c max depth (total): 145
65.78/65.85 c backtracks : 3 (1.5%)
65.78/65.85 c delayed cutoffs : 0
65.78/65.85 c repropagations : 274 (89 domain reductions, 0 cutoffs)
65.78/65.85 c avg switch length: 4.73
65.78/65.85 c switching time : 7.07
65.78/65.85 c Solution :
65.78/65.85 c Solutions found : 1 (1 improvements)
65.78/65.85 c First Solution : +0.00000000000000e+00 (in run 1, after 195 nodes, 64.37 seconds, depth 145, found by <relaxation>)
65.78/65.85 c Primal Bound : +0.00000000000000e+00 (in run 1, after 195 nodes, 64.37 seconds, depth 145, found by <relaxation>)
65.78/65.85 c Dual Bound : +0.00000000000000e+00
65.78/65.85 c Gap : 0.00 %
65.78/65.85 c Root Dual Bound : +0.00000000000000e+00
65.78/65.85 c Root Iterations : 894
65.88/65.95 c Time complete: 65.93.